Sciweavers

230 search results - page 18 / 46
» Cryptanalysis of the Quadratic Generator
Sort
View
CDC
2008
IEEE
172views Control Systems» more  CDC 2008»
13 years 9 months ago
Convex relaxation approach to the identification of the Wiener-Hammerstein model
In this paper, an input/output system identification technique for the Wiener-Hammerstein model and its feedback extension is proposed. In the proposed framework, the identificatio...
Kin Cheong Sou, Alexandre Megretski, Luca Daniel
SIAMJO
2000
113views more  SIAMJO 2000»
13 years 7 months ago
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
Masakazu Kojima, Levent Tunçel
MOC
1998
102views more  MOC 1998»
13 years 7 months ago
Classification of integral lattices with large class number
A detailed exposition of Kneser’s neighbour method for quadratic lattices over totally real number fields, and of the sub-procedures needed for its implementation, is given. Usi...
Rudolf Scharlau, Boris Hemkemeier
TNN
1998
100views more  TNN 1998»
13 years 7 months ago
A dynamical system perspective of structural learning with forgetting
—Structural learning with forgetting is an established method of using Laplace regularization to generate skeletal artificial neural networks. In this paper we develop a continu...
D. A. Miller, J. M. Zurada
OL
2011
177views Neural Networks» more  OL 2011»
12 years 10 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann