Sciweavers

61 search results - page 11 / 13
» Mechanical Verification of Hypercube Algorithms
Sort
View
DAC
2003
ACM
14 years 11 months ago
Learning from BDDs in SAT-based bounded model checking
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...
Aarti Gupta, Malay K. Ganai, Chao Wang, Zijiang Ya...
ACNS
2006
Springer
86views Cryptology» more  ACNS 2006»
14 years 2 months ago
Efficient Memory Bound Puzzles Using Pattern Databases
CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. However, the wide disparity in CPU speeds prevents such puzzles from being...
Sujata Doshi, Fabian Monrose, Aviel D. Rubin
CCS
2008
ACM
14 years 26 days ago
Avoiding timing channels in fixed-priority schedulers
A practically feasible modification to fixed-priority schedulers allows to avoid timing channels despite threads having access to precise clocks. This modification is rather simpl...
Marcus Völp, Claude-Joachim Hamann, Hermann H...
CROSSROADS
2010
13 years 5 months ago
Massive multiplayer human computation for fun, money, and survival
Crowdsourcing is an effective tool to solve hard tasks. By bringing 100,000s of people to work on simple tasks that only humans can do, we can go far beyond traditional models of ...
Lukas Biewald
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
14 years 8 days ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny