1423 search results - page 95 / 285 » Languages of Nested Trees |
126
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
140
click to vote
LACL
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
143
Voted
JLP
2010
14 years 10 months ago
2010
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...
122
Voted
HASKELL
2009
ACM
15 years 10 months ago
2009
ACM
Data-type generic programming can be used to traverse and manipulate specific parts of large heterogeneously-typed tree structures, without the need for tedious boilerplate. Gene...
142
Voted
NLP
2000
15 years 7 months ago
2000
In this article we compare the performance of various machine learning algorithms on the task of constructing word-sense disambiguation rules from data. The distinguishing characte...