155 search results - page 4 / 31 » Dynamic Succinct Ordered Trees |
JACM
2007
13 years 6 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
ICDE
2004
IEEE
14 years 8 months ago
2004
IEEE
Efficient evaluation of XML queries requires the determination of whether a relationship exists between two elements. A number of labeling schemes have been designed to label the ...
ICML
1990
IEEE
13 years 11 months ago
1990
IEEE
Decision trees that are limited to testing a single variable at a node are potentially much larger than trees that allow testing multiple variables at a node. This limitation redu...
RP
2009
Springer
14 years 1 months ago
2009
Springer
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
ESORICS
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. This paper explores the problem of tracking information flow in dynamic tree structures. Motivated by the problem of manipulating the Document Object Model (DOM) trees by...