685 search results - page 35 / 137 » Succinct Trees in Practice |
VLDB
2002
ACM
14 years 7 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
ISBRA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Hybridization is a reticulate evolutionary process. An established problem on hybridization is computing the minimum number of hybridization events, called the hybridizat...
DAC
1994
ACM
13 years 11 months ago
1994
ACM
Abstract - We propose a new algorithm for the performancedriven interconnect design problem, based on alphabetic trees. The interconnect topology is determined in a global manner a...
VLDB
2000
ACM
13 years 11 months ago
2000
ACM
We present the TreeScape system that, unlike any other system known to the authors, enables the reuse of pre-computed aggregate query results for irregular dimension hierarchies, ...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...