Sciweavers

1396 search results - page 148 / 280
» Succinct Dynamic Data Structures
Sort
View
BIRTHDAY
2008
Springer
15 years 3 months ago
A Heterogeneous Approach to UML Semantics
Abstract. UML models consist of several diagrams of different types describing different views of a software system ranging from specifications of the static system structure to de...
María Victoria Cengarle, Alexander Knapp, A...
CIDR
2003
147views Algorithms» more  CIDR 2003»
15 years 2 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe
116
Voted
CEFP
2005
Springer
15 years 7 months ago
Generic Editors for the World Wide Web
In these lecture notes we present a novel toolkit to program web applications with that have dynamic, complex behavior based on interconnect forms. This toolkit is the iData Toolki...
Rinus Plasmeijer, Peter Achten
FOCS
2000
IEEE
15 years 6 months ago
Cache-Oblivious B-Trees
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
Michael A. Bender, Erik D. Demaine, Martin Farach-...
ESANN
2004
15 years 2 months ago
Self-organizing context learning
This work is designed to contribute to a deeper understanding of the recently proposed Merging SOM (MSOM). Its context model aims at the representation of sequences, an important s...
Marc Strickert, Barbara Hammer