4305 search results - page 709 / 861 » The Test of Time |
164
click to vote
ENTCS
2008
15 years 6 months ago
2008
In its recogniser form, Earley's algorithm for testing whether a string can be derived from a grammar is worst case cubic on general context free grammars (CFG). Earley gave ...
198
click to vote
ASC
2006
15 years 6 months ago
2006
For some time, learning Bayesian networks has been both feasible and useful in many problems domains. Recently research has been done on learning equivalence classes of Bayesian n...
183
click to vote
IAJIT
2008
15 years 6 months ago
2008
: An attempt has been made in this paper to classify multispectral images using customized particle swam optimization. To reduce the time consumption due to increase in dimensional...
149
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents a case study concerning the challenges and requirements posed by next generation language resources, realized as an overall model of open, distributed and coll...
168
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...