5580 search results - page 117 / 1116 » Randomized priority algorithms |
176
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...
ICALP
2004
Springer
15 years 3 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 ...
80
Voted
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
116
click to vote
ICALP
2003
Springer
15 years 3 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...
PR
2008
14 years 9 months ago
2008
In this paper, we present a new background estimation algorithm which effectively represents both background and foreground. The problem is formulated with a labeling problem over...