Sciweavers

200 search results - page 19 / 40
» Sketching valuation functions
Sort
View
93
Voted
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
15 years 1 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth
FOCS
2005
IEEE
15 years 3 months ago
Mechanism Design via Machine Learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
AAAI
2007
14 years 12 months ago
Search Space Reduction and Russian Doll Search
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation...
Kenil C. K. Cheng, Roland H. C. Yap
165
Voted
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
15 years 9 months ago
Estimating the confidence of conditional functional dependencies
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
Graham Cormode, Lukasz Golab, Flip Korn, Andrew Mc...
CEFP
2007
Springer
15 years 3 months ago
From Interpretation to Compilation
Abstract. In this paper we sketch some experiments with the construction of a simple compiler for a high level intermediate lazy functional language, with C++ as a target language....
Jan Martin Jansen, Pieter W. M. Koopman, Rinus Pla...