Sciweavers

1743 search results - page 109 / 349
» Generalized Modal Satisfiability
Sort
View
EUROCRYPT
2008
Springer
15 years 2 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
119
Voted
GG
2010
Springer
15 years 1 months ago
Local Confluence for Rules with Nested Application Conditions
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
Hartmut Ehrig, Annegret Habel, Leen Lambers, Ferna...
108
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 27 days ago
Semantics and Evaluation of Top-k Queries in Probabilistic Databases
Abstract. We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are asso...
Xi Zhang, Jan Chomicki
85
Voted
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 11 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama
TCS
2010
14 years 11 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer