1802 search results - page 165 / 361 » Sparse Computations with PEI |
130
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
The recent upsurge of research toward compressive sampling and parsimonious signal representations hinges on signals being sparse, either naturally, or, after projecting them on a...
112
click to vote
CISS
2010
IEEE
14 years 8 months ago
2010
IEEE
—Recovery of sparse signals from noisy observations is a problem that arises in many information processing contexts. LASSO and the Dantzig selector (DS) are two well-known schem...
367
click to vote
ICA
2012
Springer
14 years 6 hour ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
119
click to vote
FIMI
2003
15 years 5 months ago
2003
We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The...
144
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
Probabilistic models have been adopted for many computer vision applications, however inference in highdimensional spaces remains problematic. As the statespace of a model grows, ...