Sciweavers

2252 search results - page 319 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
NETWORKING
2007
15 years 4 months ago
Path Selection Using Available Bandwidth Estimation in Overlay-Based Video Streaming
IP networks present a challenging environment for video streaming because they do not provide throughput, jitter, or loss rate guarantees. In this work, we focus on improving the p...
Manish Jain, Constantine Dovrolis
104
Voted
CORR
2007
Springer
120views Education» more  CORR 2007»
15 years 3 months ago
On the Feedback Capacity of Power Constrained Gaussian Noise Channels with Memory
—For a stationary additive Gaussian-noise channel with a rational noise power spectrum of a finite-order L, we derive two new results for the feedback capacity under an average ...
Shaohua Yang, Aleksandar Kavcic, Sekhar Tatikonda
149
Voted
NETWORKS
2006
15 years 3 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
TVLSI
2008
133views more  TVLSI 2008»
15 years 3 months ago
Test Data Compression Using Selective Encoding of Scan Slices
We present a selective encoding method that reduces test data volume and test application time for scan testing of Intellectual Property (IP) cores. This method encodes the slices ...
Zhanglei Wang, Krishnendu Chakrabarty
CORR
2002
Springer
104views Education» more  CORR 2002»
15 years 3 months ago
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
Michael A. Soss, Jeff Erickson, Mark H. Overmars