186 search results - page 15 / 38 » Fast Computation of Sparse Datacubes |
CVPR
2012
IEEE
12 years 7 days ago
2012
IEEE
Top-down visual saliency facilities object localization by providing a discriminative representation of target objects and a probability map for reducing the search space. In this...
IPPS
1996
IEEE
14 years 2 months ago
1996
IEEE
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit ...
JVCA
2008
13 years 9 months ago
2008
We present a fast goal-directed motion synthesis technique that integrates sample-based planning methods with constraint-based dynamics simulation using a finite element formulati...
TSP
2010
13 years 4 months ago
2010
Abstract--This paper develops an optimal decentralized algorithm for sparse signal recovery and demonstrates its application in monitoring localized phenomena using energy-constrai...