827 search results - page 25 / 166 » The Complexity of Probabilistic Lobbying |
127
click to vote
ECP
1997
Springer
15 years 6 months ago
1997
Springer
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
112
click to vote
JACM
2002
15 years 1 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
119
Voted
ICIP
2010
IEEE
14 years 11 months ago
2010
IEEE
Conventional stereoscopic video content production requires use of dedicated stereo camera rigs which is both costly and lacking video editing flexibility. In this paper, we propo...
CSE
2009
IEEE
15 years 8 months ago
2009
IEEE
—This paper contributes to the field of measuring (un)linkability in communication systems; a subproblem of privacy protection. We propose an attacker state model for attacks on...
218
click to vote
ICLP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...