Sciweavers

1888 search results - page 314 / 378
» Proof theory and computational analysis
Sort
View
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 3 days ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
DATE
2009
IEEE
116views Hardware» more  DATE 2009»
15 years 6 months ago
An MDE methodology for the development of high-integrity real-time systems
—This paper reports on experience gained and lessons learned from an intensive investigation of model-driven engineering methodology and technology for application to high-integr...
Silvia Mazzini, Stefano Puri, Tullio Vardanega
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 5 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
ECCV
2010
Springer
15 years 4 months ago
 5D Motion Subspaces for Planar Motions
In practice, rigid objects often move on a plane. The object then rotates around a fixed axis and translates in a plane orthogonal to this axis. For a concrete example, think of a ...
Roland Angst, Marc Pollefeys
SAC
2009
ACM
15 years 4 months ago
Taking total control of voting systems: firmware manipulations on an optical scan voting terminal
The firmware of an electronic voting machine is typically treated as a “trusted” component of the system. Consequently, it is misconstrued to be vulnerable only to an insider...
Seda Davtyan, Sotiris Kentros, Aggelos Kiayias, La...