Sciweavers

601 search results - page 92 / 121
» Playing large games using simple strategies
Sort
View
EUROCRYPT
2008
Springer
15 years 3 months ago
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
Jens Groth, Amit Sahai
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 5 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
AAAI
2007
15 years 3 months ago
Concurrent Action Execution with Shared Fluents
Concurrent action execution is important for plan-length minimization. However, action specifications are often limited to avoid conflicts arising from precondition/effect inter...
Michael Buro, Alexander Kovarsky
TKDE
2010
195views more  TKDE 2010»
14 years 11 months ago
Query Processing Using Distance Oracles for Spatial Networks
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
Jagan Sankaranarayanan, Hanan Samet
CSFW
2003
IEEE
15 years 6 months ago
A Procedure for Verifying Security Against Type Confusion Attacks
A type confusion attack is one in which a principal accepts data of one type as data of another. Although it has been shown by Heather et al. that there are simple formatting conv...
Catherine Meadows