214 search results - page 15 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
107
click to vote
ECML
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
JMLR
2010
14 years 4 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
100
click to vote
ACL
1996
14 years 11 months ago
1996
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
97
Voted
DMIN
2006
14 years 11 months ago
2006
Common document clustering algorithms utilize models that either divide a corpus into smaller clusters or gather individual documents into clusters. Hierarchical Agglomerative Clus...
ALGORITHMICA
2002
14 years 10 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...