2084 search results - page 99 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
126
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
115
click to vote
ICPP
1998
IEEE
15 years 6 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
128
Voted
PODC
2005
ACM
15 years 8 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
125
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
115
click to vote
ECCV
2002
Springer
16 years 4 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...