5138 search results - page 99 / 1028 » Randomized Algorithms for 3-SAT |
111
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
144
Voted
ICALP
2003
Springer
15 years 7 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...
131
Voted
AAAI
2011
14 years 1 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
PR
2008
15 years 1 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...
108
click to vote
WAW
2004
Springer
15 years 7 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, ...