132 search results - page 20 / 27 » Sparse Boolean Matrix Factorizations |
115
click to vote
CVPR
2010
IEEE
15 years 1 months ago
2010
IEEE
It has been of great interest to find sparse and/or nonnegative representations in computer vision literature. In this paper we propose a novel method to such a purpose and refer...
112
click to vote
SIGIR
2008
ACM
15 years 1 months ago
2008
ACM
We introduce the posterior probabilistic clustering (PPC), which provides a rigorous posterior probability interpretation for Nonnegative Matrix Factorization (NMF) and removes th...
144
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
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...
113
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
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...
IJCAI
2007
15 years 2 months ago
2007
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...