Sciweavers

285 search results - page 16 / 57
» New Ways to Construct Binary Search Trees
Sort
View
TOIS
2002
97views more  TOIS 2002»
14 years 11 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
ISSAC
1994
Springer
165views Mathematics» more  ISSAC 1994»
15 years 3 months ago
Constructing Permutation Representations for Large Matrix Groups
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
Gene Cooperman, Larry Finkelstein, Bryant W. York,...
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
14 years 11 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
OWLED
2007
15 years 1 months ago
Combining OWL with RCC for Spatioterminological Reasoning on Environmental Data
A new approach to spatioterminological reasoning is presented which is based on a hybrid knowledge representation system architecture and on a representation of the RCC family tree...
Rolf Grütter, Bettina Bauer-Messmer
KBS
2002
106views more  KBS 2002»
14 years 11 months ago
Hybrid decision tree
In this paper, a hybrid learning approach named HDT is proposed. HDT simulates human reasoning by using symbolic learning to do qualitative analysis and using neural learning to d...
Zhi-Hua Zhou, Zhaoqian Chen