3247 search results - page 350 / 650 » Randomized smoothing networks |
170
click to vote
IDMS
2001
Springer
15 years 11 months ago
2001
Springer
This paper uses analysis and experiments to study the minimal buffering requirements of congestion controlled multimedia applications. Applications in the Internet must use congest...
200
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
273
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
We present a new technique for using samples to estimate join cardinalities. This technique, which we term "end-biased samples," is inspired by recent work in network tr...
170
Voted
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
196
click to vote
ICPADS
2008
IEEE
16 years 1 months ago
2008
IEEE
The use of good random numbers is essential to the integrity of many mission-critical systems. However, when such systems are replicated for Byzantine fault tolerance, a serious i...