Sciweavers

612 search results - page 81 / 123
» Hardness assumptions in the foundations of theoretical compu...
Sort
View
ERSHOV
2009
Springer
14 years 2 months ago
Symbolic Bounded Conformance Checking of Model Programs
Abstract. Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of ...
Margus Veanes, Nikolaj Bjørner
FOCS
2008
IEEE
14 years 2 months ago
Network Extractor Protocols
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...
Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerm...
CVPR
2009
IEEE
1866views Computer Vision» more  CVPR 2009»
15 years 3 months ago
Understanding and evaluating blind deconvolution algorithms
Blind deconvolution is the recovery of a sharp version of a blurred image when the blur kernel is unknown. Recent algorithms have afforded dramatic progress, yet many aspects of...
Anat Levin, Yair Weiss, Frédo Durand, Willi...
EUROCRYPT
2008
Springer
13 years 9 months ago
The Twin Diffie-Hellman Problem and Applications
ded abstract of this paper appears in Advances in Cryptology -- EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the fu...
David Cash, Eike Kiltz, Victor Shoup
STACS
2009
Springer
14 years 2 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson