Sciweavers

1955 search results - page 25 / 391
» Can Computers Handle Adverbs
Sort
View
132
Voted
SP
2006
IEEE
147views Security Privacy» more  SP 2006»
15 years 9 months ago
A Computationally Sound Mechanized Prover for Security Protocols
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
Bruno Blanchet
122
Voted
CSL
2005
Springer
15 years 9 months ago
Computing with Sequences, Weak Topologies and the Axiom of Choice
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
Vasco Brattka, Matthias Schröder
130
Voted
ICCD
1997
IEEE
78views Hardware» more  ICCD 1997»
15 years 8 months ago
A new Approach for Initialization Sequences Computation for Synchronous Sequential Circuits
This paper presents a new approach to the automated generation of an initialization sequence for synchronous sequential circuits. Finding an initialization sequence is a hard task...
Fulvio Corno, Paolo Prinetto, Maurizio Rebaudengo,...
124
Voted
ECCV
2004
Springer
16 years 5 months ago
Weighted Minimal Hypersurfaces and Their Applications in Computer Vision
Abstract. Many interesting problems in computer vision can be formulated as a minimization problem for an energy functional. If this functional is given as an integral of a scalar-...
Bastian Goldlücke, Marcus A. Magnor
129
Voted
ISORC
2008
IEEE
15 years 10 months ago
Interrupt Handlers in Java
An important part of implementing device drivers is to control the interrupt facilities of the hardware platform and to program interrupt handlers. Current methods for handling in...
Stephan Korsholm, Martin Schoeberl, Anders P. Ravn