2084 search results - page 122 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
167
Voted
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
135
Voted
SODA
2001
ACM
15 years 6 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
168
Voted
BMCBI
2007
15 years 4 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
142
click to vote
SIGCOMM
1996
ACM
15 years 9 months ago
1996
ACM
Hierarchical Packet Fair Queueing (H-PFQ)algorithms have the potential to simultaneously support guaranteed realtime service, rate-adaptive best-eort, and controlled linksharing s...
155
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...