Sciweavers

363 search results - page 40 / 73
» Optimizing Memory Accesses For Spatial Computation
Sort
View
CGF
1999
125views more  CGF 1999»
13 years 7 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
CASES
2004
ACM
14 years 1 months ago
A post-compiler approach to scratchpad mapping of code
ScratchPad Memories (SPMs) are commonly used in embedded systems because they are more energy-efficient than caches and enable tighter application control on the memory hierarchy...
Federico Angiolini, Francesco Menichelli, Alberto ...
IPPS
1999
IEEE
14 years 15 hour ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
ICS
2009
Tsinghua U.
14 years 2 months ago
Zero-content augmented caches
It has been observed that some applications manipulate large amounts of null data. Moreover these zero data often exhibit high spatial locality. On some applications more than 20%...
Julien Dusser, Thomas Piquet, André Seznec
ADC
2006
Springer
136views Database» more  ADC 2006»
14 years 1 months ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao