181 search results - page 6 / 37 » On Quantification with A Finite Universe |
TIT
2002
13 years 8 months ago
2002
We offer two noiseless codes for blocks of integers Xn = (X1, . . . , Xn). We provide explicit bounds on the relative redundancy that are valid for any distribution F in the class...
ACL
1998
13 years 10 months ago
1998
A log.ical recasting of B.inding Theory is performed as an enhancing step tor the purpose ot its gull and lean declarative implementation. A new insight on sentential anaptioric p...
CSL
2009
Springer
14 years 11 days ago
2009
Springer
The aim of this paper is to understand the interplay between intersection, universally quantified, and reference types. Putting together the standard typing rules for intersection,...
AAAI
2010
13 years 10 months ago
2010
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
AUTOMATICA
2005
13 years 8 months ago
2005
It has been argued that the frequency domain accuracy of high model-order estimates obtained on the basis of closed loop data is largely invariant to whether direct or indirect ap...