Sciweavers

92 search results - page 9 / 19
» corr 1998
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 10 months ago
Sharp Bounds on the Entropy of the Poisson Law and Related Quantities
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. ...
José A. Adell, Alberto Lekuona, Yaming Yu
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 4 months ago
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
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...
Georg Moser, Andreas Schnabl
CORR
1998
Springer
99views Education» more  CORR 1998»
14 years 9 months ago
Models of Co-occurrence
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...
I. Dan Melamed
CORR
1998
Springer
104views Education» more  CORR 1998»
14 years 9 months ago
Monotonicity and Persistence in Preferential Logics
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...
Joeri Engelfriet
CORR
1998
Springer
145views Education» more  CORR 1998»
14 years 9 months ago
Anchoring a Lexicalized Tree-Adjoining Grammar for Discourse
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 ...
Bonnie L. Webber, Aravind K. Joshi