664 search results - page 21 / 133 » The tree Constraint |
113
click to vote
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
134
click to vote
LFCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
138
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
113
click to vote
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicit...
120
click to vote
TSP
2008
15 years 3 months ago
2008
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...