Sciweavers

14190 search results - page 2609 / 2838
» computing 2008
Sort
View
127
Voted
CP
2008
Springer
15 years 5 months ago
Exploiting Decomposition in Constraint Optimization Problems
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
Matthew Kitching, Fahiem Bacchus
131
Voted
CPAIOR
2008
Springer
15 years 5 months ago
Optimal Deployment of Eventually-Serializable Data Services
Abstract. Replication is a fundamental technique for increasing throughput and achieving fault tolerance in distributed data services. However, its implementation may induce signif...
Laurent Michel, Alexander A. Shvartsman, Elaine L....
132
Voted
CPAIOR
2008
Springer
15 years 5 months ago
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
Lukas Kroc, Ashish Sabharwal, Bart Selman
142
Voted
CRYPTO
2008
Springer
134views Cryptology» more  CRYPTO 2008»
15 years 5 months ago
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
Chris Peikert, Vinod Vaikuntanathan
CRYPTO
2008
Springer
75views Cryptology» more  CRYPTO 2008»
15 years 5 months ago
New Efficient Attacks on Statistical Disclosure Control Mechanisms
The goal of a statistical database is to provide statistics about a population while simultaneously protecting the privacy of the individual records in the database. The tension be...
Cynthia Dwork, Sergey Yekhanin
« Prev « First page 2609 / 2838 Last » Next »