Sciweavers

1055 search results - page 133 / 211
» Enumerations in computable structure theory
Sort
View
HYBRID
2004
Springer
14 years 3 months ago
Bisimulation of Dynamical Systems
A general notion of bisimulation is studied for dynamical systems. An algebraic characterization of bisimulation together with an algorithm for computing the maximal bisimulation r...
A. J. van der Schaft
LPAR
2001
Springer
14 years 2 months ago
A Local System for Classical Logic
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
Kai Brünnler, Alwen Fernanto Tiu
ACMICEC
2007
ACM
102views ECommerce» more  ACMICEC 2007»
14 years 2 months ago
Learning to trade with insider information
This paper introduces algorithms for learning how to trade using insider (superior) information in Kyle's model of financial markets. Prior results in finance theory relied o...
Sanmay Das
ASIACRYPT
2006
Springer
14 years 1 months ago
KFC - The Krazy Feistel Cipher
We introduce KFC, a block cipher based on a three round Feistel scheme. Each of the three round functions has an SPN-like structure for which we can either compute or bound the adv...
Thomas Baignères, Matthieu Finiasz
IMAMS
2007
157views Mathematics» more  IMAMS 2007»
13 years 11 months ago
Regularity Criteria for the Topology of Algebraic Curves and Surfaces
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...
Lionel Alberti, Bernard Mourrain