16430 search results - page 57 / 3286 » On Computable Tree Functions |
109
Voted
ACL
2006
15 years 3 months ago
2006
This paper proposes an efficient method of sentence retrieval based on syntactic structure. Collins proposed Tree Kernel to calculate structural similarity. However, structual ret...
108
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
EUROPAR
2007
Springer
15 years 6 months ago
2007
Springer
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. ...
126
click to vote
LFCS
2007
Springer
15 years 8 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...