Sciweavers

341 search results - page 28 / 69
» Redundancy elimination revisited
Sort
View
AUTOMATICA
2006
166views more  AUTOMATICA 2006»
13 years 9 months ago
On admissible pairs and equivalent feedback - Youla parameterization in iterative learning control
This paper revisits a well-known synthesis problem in iterative learning control, where the objective is to optimize a performance criterion over a class of causal iterations. The...
Mark Verwoerd, Gjerrit Meinsma, Theo de Vries
CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 8 months ago
Coding Solutions for the Secure Biometric Storage Problem
—The paper studies the problem of securely storing biometric passwords, such as fingerprints and irises. With the help of coding theory Juels and Wattenberg derived in 1999 a sc...
Davide Schipani, Joachim Rosenthal
AUSAI
2004
Springer
14 years 2 months ago
A Dynamic Allocation Method of Basis Functions in Reinforcement Learning
In this paper, we propose a dynamic allocation method of basis functions, an Allocation/Elimination Gaussian Softmax Basis Function Network (AE-GSBFN), that is used in reinforcemen...
Shingo Iida, Kiyotake Kuwayama, Masayoshi Kanoh, S...
DAC
2003
ACM
14 years 2 months ago
Realizable RLCK circuit crunching
Reduction of an extracted netlist is an important pre-processing step for techniques such as model order reduction in the design and analysis of VLSI circuits. This paper describe...
Chirayu S. Amin, Masud H. Chowdhury, Yehea I. Isma...
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 9 months ago
Sequential Rationality in Cryptographic Protocols
Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationallybounded pl...
Ronen Gradwohl, Noam Livne, Alon Rosen