169 search results - page 16 / 34 » Reductions among high dimensional proximity problems |
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
We propose an unconventional but highly effective approach
to robust fitting of multiple structures by using statistical
learning concepts. We design a novel Mercer kernel
for t...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
The locally linear embedding (LLE) algorithm is considered as a powerful method for the problem of nonlinear dimensionality reduction. In this paper, first, a new method called cl...
KDD
2001
ACM
16 years 2 days ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
112
click to vote
TSMC
2008
14 years 11 months ago
2008
Abstract--Dimensionality reduction methods have been successfully employed for face recognition. Among the various dimensionality reduction algorithms, linear (Fisher) discriminant...