2084 search results - page 145 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
136
Voted
EOR
2007
15 years 4 months ago
2007
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
153
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
123
Voted
EUROCRYPT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
259
click to vote
EMMCVPR
2011
Springer
14 years 4 months ago
2011
Springer
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
157
click to vote
TIT
2002
15 years 4 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...