5699 search results - page 187 / 1140 » Alternating model trees |
129
click to vote
SPIRE
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...
142
click to vote
SGAI
2007
Springer
15 years 11 months ago
2007
Springer
Induction of classification rules is one of the most important technologies in data mining. Most of the work in this field has concentrated on the Top Down Induction of Decision T...
170
click to vote
LICS
1997
IEEE
15 years 8 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
145
click to vote
ACL
2008
15 years 6 months ago
2008
Conventional n-best reranking techniques often suffer from the limited scope of the nbest list, which rules out many potentially good alternatives. We instead propose forest reran...
126
Voted
ACL
2003
15 years 6 months ago
2003
We introduce a MetaGrammar, which allows us to automatically generate, from a single and compact MetaGrammar hierarchy, parallel Lexical Functional Grammars (LFG) and Tree-Adjoini...