Sciweavers

4004 search results - page 35 / 801
» How Many Packets Can We Encode
Sort
View
HOTI
2005
IEEE
14 years 3 months ago
Design of Randomized Multichannel Packet Storage for High Performance Routers
High performance routers require substantial amounts of memory to store packets awaiting transmission, requiring the use of dedicated memory devices with the density and capacity ...
Sailesh Kumar, Patrick Crowley, Jonathan S. Turner
CMS
2003
101views Communications» more  CMS 2003»
13 years 11 months ago
Watermark Security via Secret Wavelet Packet Subband Structures
Abstract. Wavelet packet decompositions generalize the classical pyramidal wavelet structure. We use the vast amount of possible wavelet packet decomposition structures to create a...
Werner Dietl, Andreas Uhl
PCM
2010
Springer
183views Multimedia» more  PCM 2010»
13 years 8 months ago
Fast H.264 Encoding Based on Statistical Learning
Abstract. In this paper, we propose an efficient video coding system that applies statistical learning methods to reduce the computational cost in H.264 encoder. The proposed metho...
Chen-Kuo Chiang, Shang-Hong Lai
NETWORKING
2004
13 years 11 months ago
Reducing Packet-Loss by Taking Long-Range Dependences into Account
We show that the "fractal" behavior of Internet traffic can be efficiently and practically employed to significantly reduce packetloss. Thanks to recent advances in the t...
J. Ignacio Alvarez-Hamelin, Pierre Fraigniaud
CPAIOR
2007
Springer
14 years 4 months ago
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
Jan-Georg Smaus