16430 search results - page 288 / 3286 » On Computable Tree Functions |
133
click to vote
TAMC
2009
Springer
15 years 11 months ago
2009
Springer
We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimens...
112
click to vote
FOCS
1996
IEEE
15 years 8 months ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
150
click to vote
ACL
2009
15 years 2 months ago
2009
Tree substitution grammars (TSGs) offer many advantages over context-free grammars (CFGs), but are hard to learn. Past approaches have resorted to heuristics. In this paper, we le...
115
click to vote
ACL
2012
13 years 7 months ago
2012
We propose an improved, bottom-up method for converting CCG derivations into PTB-style phrase structure trees. In contrast with past work (Clark and Curran, 2009), which used simp...
122
click to vote
EUROPAR
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Distributed protocols resilient to Byzantine failures are notorious to be costly from the computational and communication point of view. In this paper we discuss the role...