87 search results - page 9 / 18 » Optimizing Sparse Data Structures for Matrix-vector Multiply |
SC
2005
ACM
15 years 2 months ago
2005
ACM
In contrast to traditional terascale simulations that have known, fixed data inputs, dynamic data-driven (DDD) applications are characterized by unknown data and informed by dynam...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we propose a novel approach to model shape variations. It encodes sparsity, exploits geometric redundancy, and accounts for the different degrees of local variation...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed by solving an 1-regularized linear regression prob...
ICNP
1999
IEEE
15 years 1 months ago
1999
IEEE
The design of software-based algorithms for fast IP address lookup targeted for general purpose processors has received tremendous attention in recent years due to its low cost im...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...