1510 search results - page 204 / 302 » Upper Probabilities and Additivity |
160
Voted
KR
2010
Springer
15 years 9 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
205
click to vote
CCA
2009
Springer
15 years 9 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
174
click to vote
ICDCS
2000
IEEE
15 years 8 months ago
2000
IEEE
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
147
click to vote
COCO
2000
Springer
15 years 8 months ago
2000
Springer
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
143
click to vote
SACRYPT
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We introduce the notion of nonhomomorphicity as an alternative criterion that forecasts nonlinear characteristics of a Boolean function. Although both nonhomomorphicity a...