Sciweavers

99 search results - page 7 / 20
» The Deviation Constraint
Sort
View
SIAMCO
2002
71views more  SIAMCO 2002»
13 years 7 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
SCALESPACE
2007
Springer
14 years 1 months ago
A Geometric Variational Framework for Simultaneous Registration and Parcellation of Homologous Surfaces
In clinical applications where structural asymmetries between homologous shapes have been correlated with pathology, the questions of definition and quantification of ‘asymmetr...
Nicholas A. Lord, Jeffrey Ho, Baba C. Vemuri, Step...
ICML
2010
IEEE
13 years 8 months ago
Robust Formulations for Handling Uncertainty in Kernel Matrices
We study the problem of uncertainty in the entries of the Kernel matrix, arising in SVM formulation. Using Chance Constraint Programming and a novel large deviation inequality we ...
Sahely Bhadra, Sourangshu Bhattacharya, Chiranjib ...
MP
2002
85views more  MP 2002»
13 years 7 months ago
Generalized Goal Programming: polynomial methods and applications
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
Emilio Carrizosa, Jörg Fliege
ICSE
2010
IEEE-ACM
14 years 12 days ago
From behaviour preservation to behaviour modification: constraint-based mutant generation
The efficacy of mutation analysis depends heavily on its capability to mutate programs in such a way that they remain executable and exhibit deviating behaviour. Whereas the forme...
Friedrich Steimann, Andreas Thies