224 search results - page 42 / 45 » Three New Algorithms for Regular Language Enumeration |
101
click to vote
ASM
2004
ASM
15 years 6 months ago
2004
ASM
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
106
click to vote
PAKDD
2004
ACM
15 years 6 months ago
2004
ACM
Our previous work introduced a 3D particle visualization framework that viewed each data point as being a particle affected by gravitational forces. We showed the use of this tool ...
128
click to vote
IJCNLP
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, a series of window-based methods is proposed for information retrieval. Compared with traditional tf-idf model, our approaches are based on two new key notions. The ...
OOPSLA
1997
Springer
15 years 4 months ago
1997
Springer
A type inclusion test determines whether one type is a subtype of another. Efficient type testing techniques exist for single subtyping, but not for languages with multiple subtyp...
NAACL
2003
15 years 2 months ago
2003
We propose a new phrase-based translation model and decoding algorithm that enables us to evaluate and compare several, previously proposed phrase-based translation models. Within...