688 search results - page 25 / 138 » Computing with subspaces |
PVLDB
2010
13 years 5 months ago
2010
In this paper, we tackle the problem of efficient skycube computation. We introduce a novel approach significantly reducing domination tests for a given subspace and the number of...
ICPR
2002
IEEE
14 years 3 months ago
2002
IEEE
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
Finding correspondences between feature points is one
of the most relevant problems in the whole set of visual
tasks. In this paper we address the problem of matching
a feature ...
CVPR
2012
IEEE
12 years 1 months ago
2012
IEEE
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
SIGGRAPH
2010
ACM
14 years 3 months ago
2010
ACM
We show how to greatly accelerate self-collision detection (SCD) for reduced deformable models. Given a triangle mesh and a set of deformation modes, our method precomputes Subspa...