4541 search results - page 94 / 909 » Cache-Oblivious Algorithms and Data Structures |
JCST
2006
14 years 11 months ago
2006
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
100
click to vote
SIGMOD
1999
ACM
15 years 3 months ago
1999
ACM
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set ...
BSN
2009
IEEE
15 years 6 months ago
2009
IEEE
—Advances in the miniaturisation of inertial sensors have allowed the design of compact wireless inertial orientation trackers. Such devices require data fusion algorithms to pro...
108
click to vote
GFKL
2007
Springer
15 years 3 months ago
2007
Springer
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
INFOVIS
2002
IEEE
15 years 4 months ago
2002
IEEE
Many clustering and layout techniques have been used for structuring and visualising complex data. This paper is inspired by a number of such contemporary techniques and presents ...