2924 search results - page 203 / 585 » Lower Bounds in Distributed Computing |
132
click to vote
FOSSACS
2007
Springer
15 years 9 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
149
click to vote
VTS
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper presents an improved method to accurately estimate signal probabilities using ordered partial decision diagrams (OPDDs) [Kodavarti 93] for partial representation of the...
102
click to vote
CRYPTO
2005
Springer
15 years 8 months ago
2005
Springer
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
120
click to vote
WAOA
2004
Springer
15 years 8 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
130
Voted
UAI
1998
15 years 4 months ago
1998
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...