1623 search results - page 219 / 325 » No Sorting |
126
click to vote
SPIRE
2005
Springer
15 years 11 months ago
2005
Springer
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
131
Voted
SPIRE
2005
Springer
15 years 11 months ago
2005
Springer
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
143
Voted
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
XML and XQuery semantics are very sensitive to the order of the produced output. Although pattern-tree based algebraic approaches are becoming more and more popular for evaluating...
167
Voted
DIGRA
2005
Springer
15 years 11 months ago
2005
Springer
Academic interest in game development and game studies has grown steadily in recent years, with many institutions now offering courses or programs in this area. To provide a truly...
203
Voted
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...