1612 search results - page 205 / 323 » Analysing Randomized Distributed Algorithms |
129
click to vote
STOC
1997
ACM
15 years 6 months ago
1997
ACM
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We con...
109
Voted
ALMOB
2007
15 years 2 months ago
2007
Background: The optimal score for ungapped local alignments of infinitely long random sequences is known to follow a Gumbel extreme value distribution. Less is known about the imp...
107
Voted
VLDB
2001
ACM
15 years 6 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
137
Voted
COLT
2001
Springer
15 years 7 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
119
Voted
BIRTHDAY
2009
Springer
15 years 9 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...