Sciweavers

236 search results - page 12 / 48
» Fast Sparse Matrix Multiplication
Sort
View
IPPS
1998
IEEE
13 years 11 months ago
Caching-Efficient Multithreaded Fast Multiplication of Sparse Matrices
Several fast sequential algorithms have been proposed in the past to multiply sparse matrices. These algorithms do not explicitlyaddresstheimpactofcachingonperformance. We show th...
Peter Sulatycke, Kanad Ghose
ICCV
2007
IEEE
14 years 9 months ago
Fast Pixel/Part Selection with Sparse Eigenvectors
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...
Bernard Moghaddam, Yair Weiss, Shai Avidan
IROS
2007
IEEE
117views Robotics» more  IROS 2007»
14 years 1 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
UAI
2000
13 years 8 months ago
Fast Planning in Stochastic Games
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
Michael J. Kearns, Yishay Mansour, Satinder P. Sin...
IJON
2008
116views more  IJON 2008»
13 years 7 months ago
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
Paul D. O'Grady, Barak A. Pearlmutter