154 search results - page 5 / 31 » On Boosting with Polynomially Bounded Distributions |
159
click to vote
FOCS
2010
IEEE
14 years 9 months ago
2010
IEEE
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
163
click to vote
CP
2011
Springer
13 years 11 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
94
Voted
APPROX
2007
Springer
15 years 5 months ago
2007
Springer
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
109
click to vote
CONCUR
2003
Springer
15 years 4 months ago
2003
Springer
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...