Sciweavers

730 search results - page 4 / 146
» Faster dimension reduction
Sort
View
ICCD
2005
IEEE
110views Hardware» more  ICCD 2005»
14 years 4 months ago
Implementing Caches in a 3D Technology for High Performance Processors
3D integration is an emergent technology that has the potential to greatly increase device density while simultaneously providing faster on-chip communication. 3D fabrication invo...
Kiran Puttaswamy, Gabriel H. Loh
ICASSP
2008
IEEE
14 years 1 months ago
Variance reduction with neighborhood smoothing for local intrinsic dimension estimation
Local intrinsic dimension estimation has been shown to be useful for many tasks such as image segmentation, anomaly detection, and de-biasing global dimension estimates. Of partic...
Kevin M. Carter, Alfred O. Hero
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
NPL
2006
130views more  NPL 2006»
13 years 7 months ago
A Fast Feature-based Dimension Reduction Algorithm for Kernel Classifiers
This paper presents a novel dimension reduction algorithm for kernel based classification. In the feature space, the proposed algorithm maximizes the ratio of the squared between-c...
Senjian An, Wanquan Liu, Svetha Venkatesh, Ronny T...
ICML
2010
IEEE
13 years 8 months ago
Projection Penalties: Dimension Reduction without Loss
Dimension reduction is popular for learning predictive models in high-dimensional spaces. It can highlight the relevant part of the feature space and avoid the curse of dimensiona...
Yi Zhang 0010, Jeff Schneider