535 search results - page 86 / 107 » Insertion and Expansion Operations for |
CPM
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
DATESO
2007
13 years 8 months ago
2007
We address a problem of updating XML documents having their XML schema described by a Document Type Definition (DTD) without breaking their validity. We present a way how to expre...
DAGSTUHL
2006
13 years 8 months ago
2006
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
AI
2008
Springer
13 years 6 months ago
2008
Springer
The execution performance of an information gathering plan can suffer significantly due to remote I/O latencies. A streaming dataflow model of execution addresses the problem to s...
BMCBI
2010
13 years 6 months ago
2010
Background: Today it is common to apply multiple potentially conflicting data sources to a given phylogenetic problem. At the same time, several different inference techniques are...