Sciweavers

4432 search results - page 519 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
NIPS
2008
15 years 5 months ago
On the Generalization Ability of Online Strongly Convex Programming Algorithms
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
Sham M. Kakade, Ambuj Tewari
100
Voted
AIPS
2003
15 years 5 months ago
GPT Meets PSR
We present a case study in confronting the GPT generalpurpose planner with the challenging power supply restoration (PSR) benchmark for contingent planning. PSR is derived from a ...
Blai Bonet, Sylvie Thiébaux
138
Voted
NIPS
2003
15 years 5 months ago
A Computational Geometric Approach to Shape Analysis in Images
We present a geometric approach to statistical shape analysis of closed curves in images. The basic idea is to specify a space of closed curves satisfying given constraints, and e...
Anuj Srivastava, Xiuwen Liu, Washington Mio, Eric ...
99
Voted
ADCM
2005
79views more  ADCM 2005»
15 years 3 months ago
Flexible piecewise approximations based on partition of unity
In this paper, we study a flexible piecewise approximation technique based on the use of the idea of the partition of unity. The approximations are piecewisely defined, globally sm...
Weimin Han, Wing Kam Liu
141
Voted
AMC
2004
115views more  AMC 2004»
15 years 3 months ago
Performance comparison of memetic algorithms
Local search techniques have been applied in optimization methods. The effect of local search to the memetic algorithms can make multimodal and non-linear problems easier to solve...
Jason G. Digalakis, Konstantinos G. Margaritis