2310 search results - page 327 / 462 » Coloring Random Graphs |
IM
2007
13 years 8 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
ALGORITHMICA
1998
13 years 7 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
SASO
2010
IEEE
13 years 5 months ago
2010
IEEE
We present the ColoredPower algorithm, which is designed to provide collaborative electricity demand shaping for residential and small-business customers. Demand shaping for this m...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
This paper presents a complete solution to estimating a scene’s 3D geometry and appearance from multiple 2D images by using a statistical inverse ray tracing method. Instead of ...
RECOMB
2007
Springer
14 years 8 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...