10608 search results - page 543 / 2122 » Complexity of O'Hara's Algorithm |
150
click to vote
WIA
1997
Springer
15 years 10 months ago
1997
Springer
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
156
click to vote
EACL
2006
ACL Anthology
15 years 8 months ago
2006
ACL Anthology
Metonymy recognition is generally approached with complex algorithms that rely heavily on the manual annotation of training and test data. This paper will relieve this complexity ...
189
Voted
NIPS
2004
15 years 8 months ago
2004
Successful application of reinforcement learning algorithms often involves considerable hand-crafting of the necessary non-linear features to reduce the complexity of the value fu...
171
click to vote
SDM
2003
SIAM
15 years 8 months ago
2003
SIAM
This paper presents a general framework for adapting any generative (model-based) clustering algorithm to provide balanced solutions, i.e., clusters of comparable sizes. Partition...
174
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...