214 search results - page 15 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
178
click to vote
ECML
2006
Springer
15 years 9 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...
163
click to vote
JMLR
2010
15 years 23 days 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, ...
173
click to vote
ACL
1996
15 years 7 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 ...
169
click to vote
DMIN
2006
15 years 7 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...
180
click to vote
ALGORITHMICA
2002
15 years 5 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...