9842 search results - page 1863 / 1969 » The Complexity of the Matching-Cut Problem |
COMPGEOM
2010
ACM
14 years 3 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
We propose a novel tracking algorithm for the target of which geometric appearance changes drastically over time. To track it, we present a local patch-based appearance model and p...
CVPR
2006
IEEE
15 years 3 days ago
2006
IEEE
Recently, the generative modeling approach to video segmentation has been gaining popularity in the computer vision community. For example, the flexible sprites framework has been...
CVPR
2006
IEEE
15 years 3 days ago
2006
IEEE
We propose a new approach called "appearance clustering" for scene analysis. The key idea in this approach is that the scene points can be clustered according to their s...
CVPR
2006
IEEE
15 years 3 days ago
2006
IEEE
We consider the problem of computing the likelihood of a gesture from regular, unaided video sequences, without relying on perfect segmentation of the scene. Instead of requiring ...