829 search results - page 151 / 166 » Bandit Algorithms for Tree Search |
VLDB
2004
ACM
14 years 8 months ago
2004
ACM
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
Abstract. Modern document collections often contain groups of documents with overlapping or shared content. However, most information retrieval systems process each document separa...
HICSS
2009
IEEE
14 years 3 months ago
2009
IEEE
We describe a platform for performing text and radiology analytics (TARA). We integrate commercially available hardware and middleware components to construct an environment which...
ICPP
2009
IEEE
14 years 3 months ago
2009
IEEE
—Recent advances in DNA sequencing techniques have led to an unprecedented accumulation and availability of molecular sequence data that needs to be analyzed. This data explosion...