827 search results - page 35 / 166 » The Complexity of Probabilistic Lobbying |
181
click to vote
FCT
2005
Springer
15 years 11 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
176
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
The recognition of activities from sensory data is important in advanced surveillance systems to enable prediction of high-level goals and intentions of the target under surveilla...
152
click to vote
GLOBECOM
2006
IEEE
16 years 9 days ago
2006
IEEE
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
153
click to vote
COCO
2009
Springer
16 years 24 days ago
2009
Springer
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
214
click to vote
MMAS
2011
Springer
15 years 1 months ago
2011
Springer
While existing mathematical descriptions can accurately account for phenomena at microscopic scales (e.g. molecular dynamics), these are often high-dimensional, stochastic and thei...