47 search results - page 6 / 10 » A Bound on the Performance of LDA in Randomly Projected Data... |
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 ...
ECCV
2010
Springer
14 years 27 days ago
2010
Springer
Abstract. Visual vocabulary construction is an integral part of the popular Bag-of-Features (BOF) model. When visual data scale up (in terms of the dimensionality of features or/an...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
CVPR
2010
IEEE
13 years 11 months ago
2010
IEEE
Kernel machines rely on an implicit mapping of the data such that non-linear classification in the original space corresponds to linear classification in the new space. As kernel ...