5153 search results - page 84 / 1031 » Introduction to Randomized Algorithms |
151
click to vote
ICALP
2004
Springer
15 years 10 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 ...
135
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
167
click to vote
ICALP
2003
Springer
15 years 9 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...
112
Voted
PR
2008
15 years 4 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...
133
click to vote
WAW
2004
Springer
15 years 9 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...