Sciweavers

1187 search results - page 46 / 238
» The Generalized Dimensionality Reduction Problem
Sort
View
CACM
2010
104views more  CACM 2010»
14 years 9 months ago
Faster dimension reduction
Data represented geometrically in high-dimensional vector spaces can be found in many applications. Images and videos, are often represented by assigning a dimension for every pix...
Nir Ailon, Bernard Chazelle
VLDB
2000
ACM
166views Database» more  VLDB 2000»
15 years 1 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
ICASSP
2009
IEEE
15 years 4 months ago
Separable PCA for image classification
As an alternative to standard PCA, matrix-based image dimensionality reduction methods have recently been proposed and have gained attention due to reported computational efficie...
Yongxin Taylor Xi, Peter J. Ramadge
ICPR
2008
IEEE
15 years 4 months ago
Clustering-based locally linear embedding
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...
Kanghua Hui, Chunheng Wang
STOC
1987
ACM
104views Algorithms» more  STOC 1987»
15 years 1 months ago
The Boolean Formula Value Problem Is in ALOGTIME
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...
Samuel R. Buss