Sciweavers

385 search results - page 33 / 77
» A Fast Algorithm for Matrix Balancing
Sort
View
ICASSP
2008
IEEE
14 years 4 months ago
Fast query by example of environmental sounds via robust and efficient cluster-based indexing
There has been much recent progress in the technical infrastructure necessary to continuously characterize and archive all sounds, or more precisely auditory streams, that occur w...
Jiachen Xue, Gordon Wichern, Harvey D. Thornburg, ...
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 5 months ago
The power and Arnoldi methods in an algebra of circulants
Circulant matrices play a central role in a recently proposed formulation of three-way data computations. In this setting, a three-way table corresponds to a matrix where each “...
David F. Gleich, Chen Greif, James M. Varah
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 10 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
IROS
2007
IEEE
117views Robotics» more  IROS 2007»
14 years 4 months ago
Fast 3D pose estimation with out-of-sequence measurements
— We present an algorithm for pose estimation using fixed-lag smoothing. We show that fixed-lag smoothing enables inclusion of measurements from multiple asynchronous measureme...
Ananth Ranganathan, Michael Kaess, Frank Dellaert
ICCS
2009
Springer
14 years 4 months ago
Fast Conjugate Gradients with Multiple GPUs
The limiting factor for efficiency of sparse linear solvers is the memory bandwidth. In this work, we utilize GPU’s high memory bandwidth for implementation of a sparse iterative...
Ali Cevahir, Akira Nukada, Satoshi Matsuoka