Sciweavers

37 search results - page 3 / 8
» Uniformity of Improved Versions of Chord
Sort
View
IWDC
2005
Springer
117views Communications» more  IWDC 2005»
14 years 1 months ago
Oasis: A Hierarchical EMST Based P2P Network
Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems and ...
Pankaj Ghanshani, Tarun Bansal
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 9 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
TIT
2008
90views more  TIT 2008»
13 years 7 months ago
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
Gil Wiechman, Igal Sason
PEPM
2000
ACM
13 years 11 months ago
From Recursion to Iteration: What are the Optimizations?
Transforming recursion into iteration eliminates the use of stack frames during program execution. It has been studied extensively. This paper describes a powerful and systematic ...
Yanhong A. Liu, Scott D. Stoller
GBRPR
2009
Springer
14 years 2 months ago
A Graph Based Data Model for Graphics Interpretation
A universal data model, named DG, is introduced to handle vectorized data uniformly during the whole recognition process. The model supports low level graph algorithms as well as h...
Endre Katona