Sciweavers

1763 search results - page 232 / 353
» A Formalization of Polytime Functions
Sort
View
CIE
2005
Springer
15 years 3 months ago
Formalising Exact Arithmetic in Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
Milad Niqui
EUROGP
2005
Springer
15 years 3 months ago
Evolving L-Systems to Capture Protein Structure Native Conformations
Abstract. A protein is a linear chain of amino acids that folds into a unique functional structure, called its native state. In this state, proteins show repeated substructures lik...
Gabi Escuela, Gabriela Ochoa, Natalio Krasnogor
FSE
2004
Springer
167views Cryptology» more  FSE 2004»
15 years 3 months ago
Nonce-Based Symmetric Encryption
Symmetric encryption schemes are usually formalized so as to make the encryption operation a probabilistic or state-dependent function E of the message M and the key K: the user su...
Phillip Rogaway
IMR
2004
Springer
15 years 3 months ago
A Generalized Graph-Theoretic Mesh Optimization Model
This paper presents a generic approach to mesh global optimization via node movement, based on a discrete graph-theoretic model. Mesh is considered as an electric system with lump...
Andrey A. Mezentsev
IFL
2003
Springer
15 years 3 months ago
Generic Graphical User Interfaces
It is important to be able to program GUI applications in a fast and easy manner. Current GUI tools for creating visually attractive applications offer limited functionality. In t...
Peter Achten, Marko C. J. D. van Eekelen, Rinus Pl...