Sciweavers

9842 search results - page 286 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
110
Voted
ESANN
2001
15 years 5 months ago
Optimal transfer function neural networks
Neural networks use neurons of the same type in each layer but such architecture cannot lead to data models of optimal complexity and accuracy. Networks with architectures (number ...
Norbert Jankowski, Wlodzislaw Duch
127
Voted
NIPS
2001
15 years 5 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
137
Voted
PRIS
2001
15 years 5 months ago
Improving the Robustness of Parametric Shape Tracking with Switched Multiple Models
This paper addresses the problem of tracking objects with complex motion dynamics or shape changes. It is assumed that some of the visual features detected in the image (e.g., edg...
Jacinto C. Nascimento, Jorge S. Marques
126
Voted
AUTOMATICA
2002
111views more  AUTOMATICA 2002»
15 years 3 months ago
Virtual reference feedback tuning: a direct method for the design of feedback controllers
This paper considers the problem of designing a controller for an unknown plant based on input/output measurements. The new design method we propose is direct (no model identificat...
M. C. Campi, A. Lecchini, Sergio M. Savaresi
IJON
2008
133views more  IJON 2008»
15 years 2 months ago
A multi-objective approach to RBF network learning
The problem of inductive supervised learning is discussed in this paper within the context of multi-objective (MOBJ) optimization. The smoothness-based apparent (effective) comple...
Illya Kokshenev, Antônio de Pádua Bra...