Sciweavers

369 search results - page 19 / 74
» Fast Algorithms for the Generalized Foley-Sammon Discriminan...
Sort
View
CODES
2008
IEEE
14 years 2 months ago
Static analysis for fast and accurate design space exploration of caches
Application-specific system-on-chip platforms create the opportunity to customize the cache configuration for optimal performance with minimal chip estate. Simulation, in partic...
Yun Liang, Tulika Mitra
CIVR
2007
Springer
169views Image Analysis» more  CIVR 2007»
14 years 1 months ago
Whitened LDA for face recognition
Over the years, many Linear Discriminant Analysis (LDA) algorithms have been proposed for the study of high dimensional data in a large variety of problems. An intrinsic limitatio...
Vo Dinh Minh Nhat, Sungyoung Lee, Hee Yong Youn
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
13 years 9 months ago
MACH: Fast Randomized Tensor Decompositions
Tensors naturally model many real world processes which generate multi-aspect data. Such processes appear in many different research disciplines, e.g, chemometrics, computer visio...
Charalampos E. Tsourakakis
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 7 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
NIPS
1993
13 years 8 months ago
Fast Pruning Using Principal Components
We present a new algorithm for eliminating excess parameters and improving network generalization after supervised training. The method, \Principal Components Pruning (PCP)",...
Asriel U. Levin, Todd K. Leen, John E. Moody