7930 search results - page 1133 / 1586 » Greedy in Approximation Algorithms |
228
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
181
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
189
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We consider a visual scene analysis scenario where objects (e.g. people, cars) pass through the viewing field of a static camera and need to be detected and segmented from the bac...
221
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
This paper presents a dynamic conditional random field (DCRF) model to integrate contextual constraints for object segmentation in image sequences. Spatial and temporal dependenci...
189
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper presents a novel algorithm that improves the localization of disparity discontinuities of disparity maps obtained by multi-baseline stereo. Rather than associating a di...