Sciweavers

201 search results - page 2 / 41
» Memory Optimizations For Fast Power-Aware Sparse Computation...
Sort
View
CVPR
2010
IEEE
14 years 1 months ago
Fast Sparse Representation with Prototypes
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
Jia-Bin Huang, Ming-Hsuan Yang
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
11 years 10 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
ECCV
2010
Springer
13 years 8 months ago
Robust and Fast Collaborative Tracking with Two Stage Sparse Optimization
Abstract. The sparse representation has been widely used in many areas and utilized for visual tracking. Tracking with sparse representation is formulated as searching for samples ...
Baiyang Liu, Lin Yang, Junzhou Huang, Peter Meer, ...
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 7 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
ICCS
2009
Springer
14 years 2 months ago
Fast Conjugate Gradients with Multiple GPUs
The limiting factor for efficiency of sparse linear solvers is the memory bandwidth. In this work, we utilize GPU’s high memory bandwidth for implementation of a sparse iterative...
Ali Cevahir, Akira Nukada, Satoshi Matsuoka