829 search results - page 127 / 166 » Bandit Algorithms for Tree Search |
ADBIS
2007
Springer
15 years 3 months ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
SC
2003
ACM
15 years 2 months ago
2003
ACM
We present a novel approach for decomposing contact/impact computations in which the mesh elements come in contact with each other during the course of the simulation. Effective d...
108
click to vote
SIGMETRICS
2003
ACM
15 years 2 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...
101
click to vote
SIGOPSE
1992
ACM
15 years 1 months ago
1992
ACM
Abstract-- This paper describes the design and implementation1 of IRIS: an intentional resource indicator service. IRIS springs from the concept that end-users should not be bogged...
IR
2008
14 years 9 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...