5153 search results - page 749 / 1031 » Introduction to Randomized Algorithms |
178
click to vote
MST
2010
14 years 10 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
166
click to vote
ATAL
2011
Springer
14 years 3 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
208
Voted
SIGIR
2012
ACM
13 years 6 months ago
2012
ACM
Many private and/or public organizations have been reported to create and monitor targeted Twitter streams to collect and understand users’ opinions about the organizations. Tar...
134
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
133
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...