Sciweavers

224 search results - page 42 / 45
» Three New Algorithms for Regular Language Enumeration
Sort
View
ASM
2004
ASM
15 years 2 months ago
Observations on the Decidability of Transitions
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 ×·...
Yuri Gurevich, Rostislav Yavorskiy
PAKDD
2004
ACM
97views Data Mining» more  PAKDD 2004»
15 years 2 months ago
Further Applications of a Particle Visualization Framework
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 ...
Ke Yin, Ian Davidson
IJCNLP
2004
Springer
15 years 2 months ago
Window-Based Method for Information Retrieval
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 ...
Qianli Jin, Jun Zhao, Bo Xu
OOPSLA
1997
Springer
15 years 1 months ago
Efficient Type Inclusion Tests
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...
Jan Vitek, R. Nigel Horspool, Andreas Krall
NAACL
2003
14 years 10 months ago
Statistical Phrase-Based Translation
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...
Philipp Koehn, Franz Josef Och, Daniel Marcu