Sciweavers

1449 search results - page 169 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
STOC
1999
ACM
81views Algorithms» more  STOC 1999»
15 years 10 months ago
PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability
This paper strengthens the low-error PCP characterization of NP, coming closer to the upper limit of the BGLR conjecture. Consider the task of verifying a witness for the membersh...
Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, S...
PODS
2004
ACM
109views Database» more  PODS 2004»
16 years 6 months ago
On the Complexity of Optimal K-Anonymity
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
Adam Meyerson, Ryan Williams
ESA
2009
Springer
106views Algorithms» more  ESA 2009»
16 years 28 days ago
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
Markus Bläser, Christian Hoffmann
ASM
2005
ASM
15 years 12 months ago
State Exploration with Multiple State Groupings
Abstract. Exploration algorithms are relevant to the industrial practice of gentest cases from an abstract state machine whose runs define the predicted behavior of the software s...
Colin Campbell, Margus Veanes
COLT
2005
Springer
15 years 12 months ago
Analysis of Perceptron-Based Active Learning
We start by showing that in an active learning setting, the Perceptron algorithm needs Ω( 1 ε2 ) labels to learn linear separators within generalization error ε. We then prese...
Sanjoy Dasgupta, Adam Tauman Kalai, Claire Montele...