827 search results - page 74 / 166 » The Complexity of Probabilistic Lobbying |
144
click to vote
CSFW
2005
IEEE
15 years 12 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
152
click to vote
ISPD
2004
ACM
15 years 11 months ago
2004
ACM
Due to increasing design complexity, routing congestion has become a critical problem in VLSI designs. This paper introduces a distributed metric to predict routing congestion for...
157
click to vote
PRICAI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
162
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
217
click to vote
ACIVS
2006
Springer
15 years 10 months ago
2006
Springer
Scene understanding is an important problem in intelligent robotics. Since visual information is uncertain due to several reasons, we need a novel method that has robustness to the...