186 search results - page 17 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
ICCAD
1997
IEEE
13 years 11 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
Hyperspectral imaging is a promising tool for applications in geosensing, cultural heritage and beyond. However, compared to current RGB cameras, existing hyperspectral cameras ar...
ALGORITHMICA
2005
13 years 7 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
ICPP
2002
IEEE
14 years 13 days ago
2002
IEEE
In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumptio...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...