16430 search results - page 137 / 3286 » On Computable Tree Functions |
141
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...
127
click to vote
ICMCS
2006
IEEE
15 years 9 months ago
2006
IEEE
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...
134
click to vote
EOR
2006
15 years 3 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
128
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator...
133
Voted
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...