155 search results - page 3 / 31 » Dynamic Succinct Ordered Trees |
CSR
2007
Springer
13 years 11 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
CPM
2004
Springer
13 years 10 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
CORR
2010
Springer
13 years 10 days ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
TSMC
2002
13 years 5 months ago
2002
Page-based Linear Genetic Programming (GP) is proposed in which individuals are described in terms of a number of pages. Pages are expressed in terms of a fixed number of instructi...