Sciweavers

1818 search results - page 362 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
ECCV
2010
Springer
14 years 7 days 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
14 years 4 days 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...
ASIACRYPT
2001
Springer
13 years 12 months ago
Responsive Round Complexity and Concurrent Zero-Knowledge
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
Tzafrir Cohen, Joe Kilian, Erez Petrank
ESOP
2001
Springer
13 years 12 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
ESOP
2001
Springer
13 years 12 months ago
Typestate Checking of Machine Code
We check statically whether it is safe for untrusted foreign machine code to be loaded into a trusted host system. (Here “safety” means that the program abides by a memory-acc...
Zhichen Xu, Thomas W. Reps, Barton P. Miller