Sciweavers

396 search results - page 46 / 80
» Lossy Reduction for Very High Dimensional Data
Sort
View
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 5 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
DAC
2006
ACM
16 years 23 days ago
Leakage power reduction of embedded memories on FPGAs through location assignment
Transistor leakage is poised to become the dominant source of power dissipation in digital systems, and reconfigurable devices are not immune to this problem. Modern FPGAs already...
Yan Meng, Timothy Sherwood, Ryan Kastner
TPDS
2010
174views more  TPDS 2010»
14 years 10 months ago
Parallel Two-Sided Matrix Reduction to Band Bidiagonal Form on Multicore Architectures
The objective of this paper is to extend, in the context of multicore architectures, the concepts of tile algorithms [Buttari et al., 2007] for Cholesky, LU, QR factorizations to t...
Hatem Ltaief, Jakub Kurzak, Jack Dongarra
ICDE
2008
IEEE
165views Database» more  ICDE 2008»
16 years 1 months ago
Efficient Data Interpretation and Compression over RFID Streams
Abstract-- Despite its promise, RFID technology presents numerous challenges, including incomplete data, lack of location and containment information, and very high volumes. In thi...
Richard Cocci, Thanh Tran 0002, Yanlei Diao, Prash...
NIPS
2007
15 years 1 months ago
Random Projections for Manifold Learning
We propose a novel method for linear dimensionality reduction of manifold modeled data. First, we show that with a small number M of random projections of sample points in RN belo...
Chinmay Hegde, Michael B. Wakin, Richard G. Barani...