Results 281 to 290 of about 302,787 (321)
Some of the next articles are maybe not open access.

Computer perspectives: the bandwidth famine

Communications of the ACM, 1990
A number of years ago I visited a young and successful computer company and was given a tour of the facilities by one of the directors. We passed offices in which people were working at computer terminals; I was told they constituted the accounts department. A little further on we came to the software department; here people were also using terminals. “
openaire   +2 more sources

Optical Computations for Image Bandwidth Compression. [PDF]

open access: possible, 1982
Abstract : This report summarizes the previous year's research in optical processing and optical/digital processing methods for image data compression. The following topics are discussed: (1) Radiometric and spatial transformations to achieve adaptive image data compression; (2) Spatial optical subsampling and spectral/spatial reconstruction for image ...
B. R. Hunt, R. Schowengerdt
openaire   +1 more source

Increasing the human-computer bandwidth

Digest of Papers Compcon Spring '90. Thirty-Fifth IEEE Computer Society International Conference on Intellectual Leverage, 2002
Topics discussed are high-definition television (HDTV), image compression, image density and dynamic range, and new application areas. HDTV will have a strong impact on the computing industry if it becomes a digital medium. It is certainly inevitable that HDTV will be digital, but it is as yet uncertain whether an intermediate analog standard will be ...
openaire   +2 more sources

Joint Computation Offloading and Bandwidth Assignment in Cloud-Assisted Edge Computing

IEEE Transactions on Cloud Computing, 2022
Offloading computation based on mobile edge computing paradigms can augment the computational capabilities of resource-scarce mobile devices. However, the capacity limitations of edge servers constrain the performance improvement achieved through computation offloading. In this paper, we consider a three-tier computation offloading schema with multiple
Kai Guo   +3 more
openaire   +2 more sources

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, 2017
To 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.
Katsuyoshi Iida   +2 more
openaire   +2 more sources

Computing invariants in graphs of small bandwidth

Mathematics and Computers in Simulation, 1999
Abstract 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   +2 more sources

Increasing memory bandwidth for vector computations

1994
Memory 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.
William A. Wulf   +3 more
openaire   +2 more sources

Improving Bandwidth Efficiency and fairness in cloud computing

2013 IEEE Global Communications Conference (GLOBECOM), 2013
Bandwidth is a key resource in cloud networks. Every tenant wants to be assigned the bandwidth which is proportional to the price they have paid. At the cloud vender side, the link bandwidth utilization could be enhanced to support more clients.
Xiang Sun, Nirwan Ansari
openaire   +2 more sources

Parallel Computation for the Bandwidth Minimization Problem

2009
The 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   +2 more sources

An empirical study of bandwidth predictability in mobile computing

Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization, 2008
While bandwidth predictability has been well studied in static environments, it remains largely unexplored in the context of mobile computing. To gain a deeper understanding of this important issue in the mobile environment, we conducted an eight-month measurement study consisting of 71 repeated trips along a 23Km route in Sydney under typical driving ...
Jun Yao, Salil S. Kanhere, Mahbub Hassan
openaire   +2 more sources

Home - About - Disclaimer - Privacy