Sciweavers

3328 search results - page 88 / 666
» On Plateaued Functions and Their Constructions
Sort
View
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 9 months ago
Minimizing Symmetric Set Functions Faster
We describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi [Riz00], constructs a non trivial set...
Michael Brinkmeier
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 7 months ago
Recursive Definitions of Monadic Functions
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple opt...
Alexander Krauss
CDC
2010
IEEE
216views Control Systems» more  CDC 2010»
13 years 4 months ago
On infinity norms as Lyapunov functions: Alternative necessary and sufficient conditions
This paper considers the synthesis of infinity norm Lyapunov functions for discrete-time linear systems. A proper conic partition of the state-space is employed to construct a fini...
Mircea Lazar
ISSAC
2005
Springer
77views Mathematics» more  ISSAC 2005»
14 years 2 months ago
Picard--Vessiot extensions for linear functional systems
Picard-Vessiot extensions for ordinary differential and difference equations are well known and are at the core of the associated Galois theories. In this paper, we construct fu...
Manuel Bronstein, Ziming Li, Min Wu
ASIACRYPT
2006
Springer
14 years 21 days ago
Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions
In this paper, we describe generic attacks on unbalanced Feistel schemes with contracting functions. These schemes are used to construct pseudo-random permutations from kn bits to ...
Jacques Patarin, Valérie Nachef, Côme...