Sciweavers

2311 search results - page 231 / 463
» Robustness and Generalization
Sort
View
AUTOMATICA
2006
166views more  AUTOMATICA 2006»
15 years 6 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
JAIR
2006
87views more  JAIR 2006»
15 years 6 months ago
Fault Tolerant Boolean Satisfiability
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Amitabha Roy
JALC
2006
87views more  JALC 2006»
15 years 6 months ago
A Team Automaton Scenario for the Analysis of Security Properties of Communication Protocols
Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automa...
Maurice H. ter Beek, Gabriele Lenzini, Marinella P...
PAMI
2008
196views more  PAMI 2008»
15 years 6 months ago
Distance Learning for Similarity Estimation
In this paper, we present a general guideline to find a better distance measure for similarity estimation based on statistical analysis of distribution models and distance function...
Jie Yu, Jaume Amores, Nicu Sebe, Petia Radeva, Qi ...
PAMI
2006
141views more  PAMI 2006»
15 years 6 months ago
Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameter
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
Stéphane Lafon, Ann B. Lee