Sciweavers

3894 search results - page 558 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ECCV
2010
Springer
15 years 12 months ago
Optimizing Complex Loss Functions in Structured Prediction
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
HM
2009
Springer
145views Optimization» more  HM 2009»
15 years 11 months ago
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...
ECML
2007
Springer
15 years 10 months ago
Efficient Continuous-Time Reinforcement Learning with Adaptive State Graphs
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...
Gerhard Neumann, Michael Pfeiffer, Wolfgang Maass
ICIP
1995
IEEE
15 years 10 months ago
Multigrid adaptive image processing
We consider a general weighted least squares approximation problem with a membrane spline regularization term. The key parameters in this formulation are the weighting factors whi...
Michael Unser
ICMLA
2008
15 years 8 months ago
Basis Function Construction in Reinforcement Learning Using Cascade-Correlation Learning Architecture
In reinforcement learning, it is a common practice to map the state(-action) space to a different one using basis functions. This transformation aims to represent the input data i...
Sertan Girgin, Philippe Preux