406 search results - page 65 / 82 » Database-friendly random projections |
ICDM
2003
IEEE
14 years 25 days ago
2003
IEEE
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
ISMAR
2002
IEEE
14 years 14 days ago
2002
IEEE
Camera tracking is a fundamental requirement for videobased Augmented Reality applications. The ability to accurately calculate the intrinsic and extrinsic camera parameters for e...
DAWAK
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
COCO
1998
Springer
13 years 11 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...