Sciweavers

1192 search results - page 37 / 239
» Computing Weakest Readings
Sort
View
IPPS
2006
IEEE
15 years 5 months ago
Securing embedded programmable gate arrays in secure circuits
The purpose of this article is to propose a survey of possible approaches for implementing embedded reconfigurable gate arrays into secure circuits. A standard secure interfacing ...
Nicolas Valette, Lionel Torres, Gilles Sassatelli,...
TCC
2005
Springer
118views Cryptology» more  TCC 2005»
15 years 5 months ago
On the Relationships Between Notions of Simulation-Based Security
Several compositional forms of simulation-based security have been proposed in the literature, including universal composability, black-box simulatability, and variants thereof. Th...
Anupam Datta, Ralf Küsters, John C. Mitchell,...
TRIER
2002
14 years 11 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl
SCIA
2011
Springer
223views Image Analysis» more  SCIA 2011»
14 years 2 months ago
Stable Structure from Motion for Unordered Image Collections
We present a non-incremental approach to structure from motion. Our solution is based on robustly computing global rotations from relative geometries and feeding these into the kno...
Carl Olsson, Olof Enqvist
CONCUR
2012
Springer
13 years 2 months ago
Avoiding Shared Clocks in Networks of Timed Automata
Networks of timed automata (NTA) are widely used to model distributed real-time systems. Quite often in the literature, the automata are allowed to share clocks. This is a problem ...
Sandie Balaguer, Thomas Chatain