9209 search results - page 10 / 1842 » Data Space Randomization |
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Random subspaces are a popular ensemble construction technique that improves the accuracy of weak classifiers. It has been shown, in different domains, that random subspaces combi...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
The Restricted Isometry Property (RIP) is an important concept in compressed sensing. It is well known that many random matrices satisfy the RIP with high probability, whenever th...
STOC
1998
ACM
13 years 12 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...
PAMI
2006
13 years 7 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...