Results 201 to 210 of about 12,702 (258)

Image‐Based Spatio‐Temporal Interpolation for Split Rendering

open access: yesComputer Graphics Forum, EarlyView.
Abstract Low‐powered devices – such as small form factor head‐mounted displays (HMDs) – struggle to deliver a smooth and high‐quality viewing experience, due to their limited power and rendering capabilities. Cloud rendering attempts to solve the quality issue, but leads to prohibitive latency and bandwidth requirements, hindering use with HMDs over ...
M. Steiner   +4 more
wiley   +1 more source

Variable‐Rate Texture Compression: Real‐Time Rendering with JPEG

open access: yesComputer Graphics Forum, EarlyView.
Abstract Although variable‐rate compressed image formats such as JPEG are widely used to efficiently encode images, they have not found their way into real‐time rendering due to special requirements such as random access to individual texels. In this paper, we investigate the feasibility of variable‐rate texture compression on modern GPUs using the ...
Elias Kristmann   +2 more
wiley   +1 more source

Ad hoc bandwidth requests and power conservation in 5G wireless networks with tiny cells. [PDF]

open access: yesSci Rep
Rajesh A   +6 more
europepmc   +1 more source

Bandwidth allocation with preemption

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95, 1995
Summary: Bandwidth allocation is a fundamental problem in the design of networks where bandwidth has to be reserved for connections in advance. The problem is intensified when the overall requested bandwidth exceeds the capacity and not all requests can be served. Furthermore, acceptance/rejection decisions regarding connections have to be made online,
Amotz Bar-Noy   +4 more
openaire   +2 more sources

Gradient bandwidth allocations

ACM SIGMETRICS Performance Evaluation Review, 2015
We look at bandwidth-sharing networks where bandwidth allocations are not known to maximize a priori any utility function. Instead, we only require the allocation functions to be 0-homogeneous and concave, which are desirable properties in many situations.
Matthieu Jonckheere, Seva Shneer
openaire   +1 more source

Allocating Bandwidth for Bursty Connections

SIAM Journal on Computing, 1997
Summary: We undertake the first study of statistical multiplexing from the perspective of approximation algorithms. The basic issue underlying statistical multiplexing is the following: in high-speed networks, individual connections (i.e., communication sessions) are very bursty, with transmission rates that vary greatly over time. As such, the problem
Jon M. Kleinberg   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy