3471 search results - page 540 / 695 » Obstacle Numbers of Graphs |
184
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...
161
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...
150
Voted
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
171
Voted
PPOPP
2009
ACM
16 years 6 months ago
2009
ACM
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
193
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...