886 search results - page 113 / 178 » On the Autoreducibility of Random Sequences |
242
click to vote
APPROX
2007
Springer
15 years 12 months ago
2007
Springer
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
153
click to vote
SOFSEM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
149
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
210
click to vote
WIDM
2004
ACM
15 years 11 months ago
2004
ACM
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
162
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...