1949 search results - page 135 / 390 » Random graphs on surfaces |
153
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noi...
112
click to vote
COCOON
2009
Springer
15 years 11 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
175
click to vote
PROPERTYTESTING
2010
15 years 2 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
138
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
134
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...