201 search results - page 24 / 41 » Memory Optimizations For Fast Power-Aware Sparse Computation... |
EUROPAR
2001
Springer
14 years 2 months ago
2001
Springer
High-accuracy PDE solvers use multi-dimensional fast Fourier transforms. The FFTs exhibits a static and structured memory access pattern which results in a large amount of communic...
DC
2010
13 years 10 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
DCC
2010
IEEE
13 years 8 months ago
2010
IEEE
Remote visualization of an arbitrary 2-D planar "cut" from a large volumetric dataset with random access has both gained importance and posed significant challenges over...
ASPLOS
1991
ACM
14 years 1 months ago
1991
ACM
Access/execute architectures have several advantages over more traditional architectures. Because address generation and memory access are decoupled from operand use, memory laten...
AMDO
2010
Springer
14 years 11 days ago
2010
Springer
Abstract. In this paper, we present a novel, fast, resolution-independent silhouette area-based matching approach. We approximate the silhouette area by a small set of axis-aligned...