Sciweavers

3192 search results - page 212 / 639
» The minimum latency problem
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Shannon meets Nyquist: Capacity limits of sampled analog channels
We explore several fundamental questions at the intersection of sampling theory and information theory. In particular, we study how capacity is affected by a given sampling mechan...
Yuxin Chen, Yonina C. Eldar, Andrea J. Goldsmith
APPROX
2006
Springer
179views Algorithms» more  APPROX 2006»
15 years 10 months ago
On Bounded Distance Decoding for General Lattices
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice v represented by some basis, and a target point y, nd the lattice point close...
Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio
INFOCOM
2009
IEEE
16 years 1 months ago
Random Linear Network Coding For Time Division Duplexing: When To Stop Talking And Start Listening
—A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes...
Daniel Enrique Lucani, Milica Stojanovic, Muriel M...
ICNP
2002
IEEE
15 years 11 months ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...
ICS
2000
Tsinghua U.
15 years 10 months ago
Push vs. pull: data movement for linked data structures
As the performance gap between the CPU and main memory continues to grow, techniques to hide memory latency are essential to deliver a high performance computer system. Prefetchin...
Chia-Lin Yang, Alvin R. Lebeck