4171 search results - page 652 / 835 » Choice numbers of graphs |
188
click to vote
PODC
2004
ACM
15 years 12 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
165
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
195
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
We are building a system that can automatically acquire 3D range scans and 2D images to build geometrically and photometrically correct 3D models of urban environments. A major bo...
200
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
171
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
We present an algorithm for performing Lambertian photometric stereo in the presence of shadows. The algorithm has three novel features. First, a fast graph cuts based method is u...