Sciweavers

532 search results - page 50 / 107
» Tree exploration with advice
Sort
View
BNCOD
2003
91views Database» more  BNCOD 2003»
13 years 9 months ago
Persistent Indexing Technology for Large Sequences
There are two aspects to the work being presented here. The first is a novel persistent index structure for genomic data, a prototype of which has been completed. The second, usin...
Robert Japp
FGCS
2000
81views more  FGCS 2000»
13 years 7 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
TOIS
2002
97views more  TOIS 2002»
13 years 7 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
HICSS
2002
IEEE
191views Biometrics» more  HICSS 2002»
14 years 18 days ago
Mindmap: Utilizing Multiple Taxonomies and Visualization to Understand a Document Collection
We present a novel system and methodology for browsing and exploring topics and concepts within a document collection. The process begins with the generation of multiple taxonomie...
W. Scott Spangler, Jeffrey T. Kreulen, Justin Less...
CEC
2009
IEEE
14 years 2 months ago
Representation and structural biases in CGP
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
Andrew J. Payne, Susan Stepney