Sciweavers

1096 search results - page 21 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
VLDB
1994
ACM
121views Database» more  VLDB 1994»
15 years 1 months ago
The Impact of Global Clustering on Spatial Database Systems
Global clustering has rarely been investigated in the area of spatial database systems although dramatic performance improvements can be achieved by using suitable techniques. In ...
Thomas Brinkhoff, Hans-Peter Kriegel
IPPS
2009
IEEE
15 years 4 months ago
Building a parallel pipelined external memory algorithm library
Large and fast hard disks for little money have enabled the processing of huge amounts of data on a single machine. For this purpose, the well-established STXXL library provides a...
Andreas Beckmann, Roman Dementiev, Johannes Single...
IBPRIA
2007
Springer
15 years 3 months ago
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
José Oncina, Franck Thollard, Eva Gó...
ATAL
2010
Springer
14 years 11 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
ICCD
2005
IEEE
165views Hardware» more  ICCD 2005»
15 years 6 months ago
Counter-Based Cache Replacement Algorithms
Recent studies have shown that in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large,...
Mazen Kharbutli, Yan Solihin