5115 search results - page 77 / 1023 » On Randomized Lanczos Algorithms |
ALT
2008
Springer
15 years 8 months ago
2008
Springer
This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincid...
198
click to vote
Book
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
107
click to vote
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
126
click to vote
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...