Sciweavers

206 search results - page 24 / 42
» Efficient adaptive collect using randomization
Sort
View
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
14 years 12 days 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
ASPLOS
2010
ACM
13 years 12 months ago
Butterfly analysis: adapting dataflow analysis to dynamic parallel monitoring
Online program monitoring is an effective technique for detecting bugs and security attacks in running applications. Extending these tools to monitor parallel programs is challeng...
Michelle L. Goodstein, Evangelos Vlachos, Shimin C...
JUCS
2008
117views more  JUCS 2008»
13 years 8 months ago
Eliminating Cycles in Weak Tables
: Weak References constitute an elegant mechanism for an application to interact with its garbage collector. In most of its typical uses, weak references are used through weak tabl...
Alexandra Barros, Roberto Ierusalimschy
CIKM
2010
Springer
13 years 6 months ago
Online stratified sampling: evaluating classifiers at web-scale
Deploying a classifier to large-scale systems such as the web requires careful feature design and performance evaluation. Evaluation is particularly challenging because these larg...
Paul N. Bennett, Vitor R. Carvalho
SIAMCO
2011
13 years 3 months ago
Consistency of Sequential Bayesian Sampling Policies
We consider Bayesian information collection, in which a measurement policy collects information to support a future decision. This framework includes ranking and selection, continu...
Peter Frazier, Warren B. Powell