Results 331 to 340 of about 3,719,507 (369)
Some of the next articles are maybe not open access.
A bandwidth allocation scheme based on residual bandwidth information in mobile edge computing
Proceedings of the 2nd Workshop on Middleware for Edge Clouds & Cloudlets - MECC '17, 2017To meet the requirements of each flow in mobile edge computing (MEC) which coexists flows with different round-trip times (RTTs) and requirements about transmission rate, we previously proposed a bandwidth allocation scheme based on collectable information and showed the effectiveness of this approach in MEC.
Yusuke Ito +2 more
openaire +1 more source
Increasing Memory Bandwidth for Vector Computations
1993Memory bandwidth is rapidly becoming the performance bottleneck in the application of high performance micro- processors to vector-like algorithms, including the "Grand Challenge" scientific problems. Caching is not the sole solution for these applications due to the poor temporal and spatial locality of their data accesses.
openaire +1 more source
Computing invariants in graphs of small bandwidth
Mathematics and Computers in Simulation, 1999Abstract Many graph invariants (chromatic number, rook polynomial, Tutte polynomial, etc.) are known to be computable for general graphs in exponential time only. Algorithms for their computation usually depend on special properties of the invariants and are not extendable to slightly different problems.
openaire +1 more source
Personalized and Differential Privacy-Aware Video Stream Offloading in Mobile Edge Computing
IEEE Transactions on Cloud ComputingIn Mobile Edge Computing (MEC), the collaboration between end devices and servers guarantees the low-latency and high-accuracy video stream analysis. However, such paradigm of video stream offloading poses a serious threat to the location privacy and the
Ping Zhao, Ziyi Yang, Guanglin Zhang
semanticscholar +1 more source
Parallel Computation for the Bandwidth Minimization Problem
2009The bandwidth minimization problem is a classical combinatorial optimization problem that has been studied since around 1960. It is formulated as follows. Given a connected graph G = (V;E) with n nodes and m edges, find a labeling π, i.e. a bijection between V and {1; 2;… ; n}, such that the maximum difference |π(u)–(v)|, uv e E, is minimized.
Khoa T. Vo, Gerhard Reinelt
openaire +1 more source
Vehicular Edge Computing and Networking: A Survey
Journal on spesial topics in mobile networks and applications, 2019As one key enabler of Intelligent Transportation System (ITS), Vehicular Ad Hoc Network (VANET) has received remarkable interest from academia and industry.
Lei Liu +4 more
semanticscholar +1 more source
How Is Bandwidth Used in Computers?
2007This chapter will explore the issue of bandwidth: how it is used, and how that effects the performance of an individual processor in a system, as well as how it impacts the overall system. It will examine the current trends in system evolution, and explain what those trends imply in light of bandwidth. Finally, the chapter will explore the technologies
openaire +1 more source
Optical computing for image bandwidth compression: analysis and simulation
Applied Optics, 1978Image bandwidth compression is dominated by digital methods for carrying out the required computations. This paper discusses the general problem of using optics to realize the computations in bandwidth compression. A common method of digital bandwidth compression, feedback differential pulse code modulation (DPCM), is reviewed, and the obstacles to ...
openaire +2 more sources
Journal of Materials Science: Materials in Electronics, 2018
K. Demir +8 more
semanticscholar +1 more source
K. Demir +8 more
semanticscholar +1 more source