721 search results - page 60 / 145 » Almost universal graphs |
149
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
221
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
84
Voted
SIBGRAPI
2006
IEEE
15 years 6 months ago
2006
IEEE
Region-based approaches to cel painting typically use shape similarity and topology relations between regions of consecutive animation frames. This paper presents a new colorizati...
101
click to vote
STOC
2006
ACM
15 years 5 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
SAT
2004
Springer
15 years 5 months ago
2004
Springer
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...