1510 search results - page 20 / 302 » Upper Probabilities and Additivity |
DLT
2007
13 years 11 months ago
2007
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
In this paper we study statistical properties of the error covariance matrix of a Kalman filter, when it is subject to random measurement losses. We introduce a sequence of tighter...
EDBT
2009
ACM
14 years 1 months ago
2009
ACM
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
Recently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probabil...