15 search results - page 2 / 3 » Cached k-d tree search for ICP algorithms |
SODA
2003
ACM
13 years 5 months ago
2003
ACM
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
WABI
2009
Springer
13 years 11 months ago
2009
Springer
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
VLDB
1999
ACM
13 years 8 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
SIGMETRICS
2003
ACM
13 years 9 months ago
2003
ACM
In main-memory databases, the number of processor cache misses has a critical impact on the performance of the system. Cacheconscious indices are designed to improve performance b...
AAAI
2006
13 years 6 months ago
2006
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...