5153 search results - page 662 / 1031 » Introduction to Randomized Algorithms |
150
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
159
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
167
click to vote
TACAS
2007
Springer
15 years 11 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
141
click to vote
SPAA
1997
ACM
15 years 9 months ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
155
Voted
BMCBI
2008
15 years 5 months ago
2008
Background: Comparative prediction of RNA structures can be used to identify functional noncoding RNAs in genomic screens. It was shown recently by Babak et al. [BMC Bioinformatic...