One of the difficulties in calculating the capacity of certain Poisson channels is that H(), the entropy of the Poisson distribution with mean , is not available in a simple form. ...
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
A model of co-occurrence in bitext is a boolean predicate that indicates whether a given pair of word tokens co-occur in corresponding regions of the bitext space. Co-occurrence i...
An important characteristic of many logics for Arti cial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequ...
We here explore a "fully" lexicalized Tree-Adjoining Grammar for discourse that takes the basic elements of a (monologic) discourse to be not simply clauses, but larger ...