4007 search results - page 643 / 802 » Computation with imprecise probabilities |
126
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
130
Voted
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
129
Voted
CRYPTO
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime ...
124
Voted
DIALM
2008
ACM
15 years 5 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
148
Voted
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...