1029 search results - page 194 / 206 » Probabilistic Recurrence Relations |
165
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
160
Voted
SIGMOD
1993
ACM
15 years 6 months ago
1993
ACM
This paper introduces a new approach to database disk buffering, called the LRU–K method. The basic idea of LRU–K is to keep track of the times of the last K references to pop...
116
Voted
STOC
1993
ACM
15 years 6 months ago
1993
ACM
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
173
click to vote
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
122
click to vote
SIGIR
2010
ACM
15 years 6 months ago
2010
ACM
Pseudo-relevance feedback is an effective technique for improving retrieval results. Traditional feedback algorithms use a whole feedback document as a unit to extract words for ...