836 search results - page 57 / 168 » On the Complexity of Train Assignment Problems |
145
click to vote
NIPS
2004
15 years 5 months ago
2004
We describe semi-Markov conditional random fields (semi-CRFs), a conditionally trained version of semi-Markov chains. Intuitively, a semiCRF on an input sequence x outputs a "...
161
click to vote
ACL
2010
15 years 1 months ago
2010
A fundamental step in sentence comprehension involves assigning semantic roles to sentence constituents. To accomplish this, the listener must parse the sentence, find constituent...
133
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...
119
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
134
click to vote
EMNLP
2007
15 years 5 months ago
2007
We present an adaptation of constraint satisfaction inference (Canisius et al., 2006b) for predicting dependency trees. Three different classifiers are trained to predict weighte...