Sciweavers

113 search results - page 8 / 23
» Rigid Components of Random Graphs
Sort
View
RSA
2010
104views more  RSA 2010»
13 years 5 months ago
Random graphs with forbidden vertex degrees
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
Geoffrey R. Grimmett, Svante Janson
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
14 years 8 days ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
IJCV
2008
281views more  IJCV 2008»
13 years 6 months ago
Simultaneous Segmentation and Pose Estimation of Humans Using Dynamic Graph Cuts
Abstract This paper presents a novel algorithm for performing integrated segmentation and 3D pose estimation of a human body from multiple views. Unlike other state of the art meth...
Pushmeet Kohli, Jonathan Rihan, Matthieu Bray, Phi...
CP
2004
Springer
14 years 4 days ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
13 years 6 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald