2168 search results - page 33 / 434 » Randomized Algorithms and Complexity Theory |
105
click to vote
SODA
2000
ACM
15 years 1 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
155
click to vote
PODC
2011
ACM
14 years 2 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
100
click to vote
CORR
2000
Springer
14 years 11 months ago
2000
Springer
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
EATCS
2002
14 years 11 months ago
2002
Extractors are functions which are able to "extract" random bits from arbitrary distributions which "contain" sufficient randomness. Explicit constructions of ...