Sciweavers

30 search results - page 6 / 6
» Coresets, sparse greedy approximation, and the Frank-Wolfe a...
Sort
View

Publication
210views
13 years 11 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches to correspondence involve matching features between images. In this pa...
Gemma Roig, Xavier Boix, Fernando De la Torre
CORR
2010
Springer
210views Education» more  CORR 2010»
13 years 4 months ago
Exploiting Statistical Dependencies in Sparse Representations for Signal Recovery
Signal modeling lies at the core of numerous signal and image processing applications. A recent approach that has drawn considerable attention is sparse representation modeling, in...
Tomer Faktor, Yonina C. Eldar, Michael Elad
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
13 years 11 months ago
Optimizing Frequency Queries for Data Mining Applications
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
Hassan H. Malik, John R. Kender
CORR
2008
Springer
178views Education» more  CORR 2008»
13 years 4 months ago
Model-Based Compressive Sensing
Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for acquisition of sparse or compressible signals that can be well approximated by just K N elements from a...
Richard G. Baraniuk, Volkan Cevher, Marco F. Duart...
IPPS
2008
IEEE
13 years 11 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri