Sciweavers

4131 search results - page 219 / 827
» Compactness in Topology and Computation
Sort
View
SIAMSC
2011
177views more  SIAMSC 2011»
15 years 1 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad
CGO
2003
IEEE
15 years 12 months ago
Optimizing Memory Accesses For Spatial Computation
In this paper we present the internal representation and optimizations used by the CASH compiler for improving the memory parallelism of pointer-based programs. CASH uses an SSA-b...
Mihai Budiu, Seth Copen Goldstein
SPIESR
1998
151views Database» more  SPIESR 1998»
15 years 7 months ago
Synthesizing Parallel Imaging Applications Using the CAP Computer-Aided Parallelization Tool
Abstract. Imaging applications such as filtering, image transforms and compression/decompression require vast amounts of computing power when applied to large data sets. These appl...
Benoit A. Gennart, Marc Mazzariol, Vincent Messerl...
ICDE
2009
IEEE
130views Database» more  ICDE 2009»
16 years 8 months ago
Recursive Computation of Regions and Connectivity in Networks
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...
Mengmeng Liu, Nicholas E. Taylor, Wenchao Zhou, Za...
ATAL
2009
Springer
16 years 1 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...