16404 search results - page 2609 / 3281 » A set coverage problem |
176
click to vote
ICGI
2004
Springer
16 years 18 days ago
2004
Springer
State Merging algorithms, such as Rodney Price’s EDSM (Evidence-Driven State Merging) algorithm, have been reasonably successful at solving DFA-learning problems. EDSM, however, ...
226
click to vote
IICS
2004
Springer
16 years 18 days ago
2004
Springer
Facing the retrieval problem according to the overwhelming set of documents online the adaptation of text categorization to web units has recently been pushed. The aim is to utiliz...
177
click to vote
IJCNLP
2004
Springer
16 years 18 days ago
2004
Springer
We present a study of new word identification (NWI) to improve the performance of a Chinese word segmenter. In this paper the distribution and types of new words are discussed emp...
176
click to vote
IJCNLP
2004
Springer
16 years 18 days ago
2004
Springer
We study the problem of efficiently removing equal frequency n-gram substrings from an n-gram set, formally called Statistical Substring Reduction (SSR). SSR is a useful operatio...
205
click to vote
ILP
2004
Springer
16 years 18 days ago
2004
Springer
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. Our research has focused on Information Extraction (IE), a task that typically invol...