827 search results - page 146 / 166 » The Complexity of Probabilistic Lobbying |
239
click to vote
POPL
2009
ACM
16 years 2 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
132
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
206
Voted
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
126
click to vote
ICRA
2008
IEEE
15 years 8 months ago
2008
IEEE
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
103
Voted
NDSS
2008
IEEE
15 years 8 months ago
2008
IEEE
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...