Machine Translation in India is relatively young. The earliest efforts date from the late 80s and early 90s. The success of every system is judged from its evaluation experimental...
The busy beaver problem is to find the maximum number of 1’s that can be printed by an n-state Turing machine of a particular type. A critical step in the evaluation of this va...
In this paper we evaluate two methods for key estimation from polyphonic audio recordings. Our goal is to compare between a strategy using a cognition-inspired model and several m...
We have proposed a method of machine translation, which acquires translation rules from translation examples using inductive learning, and have evaluated the method. And we have c...
Machines for Dialogue Games P.-L. Curien (CNRS - Paris 7) H. Herbelin (INRIA-Futurs) July 16, 2005 The notion of abstract B¨ohm tree has arisen as an operationally-oriented disti...