Sciweavers

115 search results - page 3 / 23
» Versioning Tree Structures by Path-Merging
Sort
View
ESSLLI
1999
Springer
13 years 9 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
13 years 11 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
IPL
2008
87views more  IPL 2008»
13 years 5 months ago
Optimal prefix and suffix queries on texts
Abstract. In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied M
Maxime Crochemore, Costas S. Iliopoulos, Mohammad ...
LICS
2008
IEEE
13 years 11 months ago
From Automatic Structures to Borel Structures
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb...
CORR
2012
Springer
222views Education» more  CORR 2012»
12 years 1 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach