Sciweavers

AUTOMATICA
2008
82views more  AUTOMATICA 2008»
13 years 4 months ago
Iterative minimization of H2 control performance criteria
Data-based control design methods most often consist of iterative adjustment of the controller's parameters towards the parameter values which minimize an H2 performance crit...
Alexandre S. Bazanella, Michel Gevers, Ljubisa Mis...
NIPS
1990
13 years 5 months ago
Planning with an Adaptive World Model
We present a new connectionist planning method TML90 . By interaction with an unknown environment, a world model is progressively constructed using gradient descent. For deriving ...
Sebastian Thrun, Knut Möller, Alexander Linde...
NIPS
2007
13 years 6 months ago
Topmoumoute Online Natural Gradient Algorithm
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...
Nicolas Le Roux, Pierre-Antoine Manzagol, Yoshua B...
NIPS
2008
13 years 6 months ago
Mind the Duality Gap: Logarithmic regret algorithms for online optimization
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
Shai Shalev-Shwartz, Sham M. Kakade
IPCV
2008
13 years 6 months ago
A Faster-converging Algorithm for Image Segmentation with a Modified Chan-Vese Model
We propose an algorithm for segmentation of grayscale images. Our algorithm computes a solution to the convex, unconstrained minimization problem proposed by T. Chan, S. Esedo
Rick Chartrand, Valentina Staneva
ECCV
2008
Springer
13 years 6 months ago
Reformulating and Optimizing the Mumford-Shah Functional on a Graph - A Faster, Lower Energy Solution
Active contour formulations predominate current minimization of the Mumford-Shah functional (MSF) for image segmentation and filtering. Unfortunately, these formulations necessitat...
Leo Grady, Christopher V. Alvino
ICANN
2007
Springer
13 years 8 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel
ICANN
2001
Springer
13 years 9 months ago
Fast Curvature Matrix-Vector Products
The method of conjugate gradients provides a very effective way to optimize large, deterministic systems by gradient descent. In its standard form, however, it is not amenable to ...
Nicol N. Schraudolph
IPMI
2003
Springer
13 years 9 months ago
Tunnelling Descent: A New Algorithm for Active Contour Segmentation of Ultrasound Images
The presence of speckle in ultrasound images makes it hard to segment them using active contours. Speckle causes the energy function of the active contours to have many local minim...
Zhong Tao, C. Carl Jaffe, Hemant Tagare
ATAL
2004
Springer
13 years 10 months ago
Product Distribution Theory for Control of Multi-Agent Systems
Product Distribution (PD) theory is a new framework for controlling Multi-Agent Systems (MAS’s). First we review one motivation of PD theory, as the information-theoretic extens...
Chiu Fan Lee, David H. Wolpert