Sciweavers

171 search results - page 27 / 35
» Convex Sparse Matrix Factorizations
Sort
View
ICASSP
2011
IEEE
12 years 10 months ago
Sparse non-negative decomposition of speech power spectra for formant tracking
Many works on speech processing have dealt with auto-regressive (AR) models for spectral envelope and formant frequency estimation, mostly focusing on the estimation of the AR par...
Jean-Louis Durrieu, Jean-Philippe Thiran
FOCS
2008
IEEE
14 years 1 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
IJCAI
2007
13 years 8 months ago
Fast Incremental Square Root Information Smoothing
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
Michael Kaess, Ananth Ranganathan, Frank Dellaert
JMLR
2008
188views more  JMLR 2008»
13 years 6 months ago
Maximal Causes for Non-linear Component Extraction
We study a generative model in which hidden causes combine competitively to produce observations. Multiple active causes combine to determine the value of an observed variable thr...
Jörg Lücke, Maneesh Sahani
COMPUTING
2007
103views more  COMPUTING 2007»
13 years 7 months ago
An algebraic approach for H-matrix preconditioners
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
S. Oliveira, F. Yang