Sciweavers

5595 search results - page 828 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ECCV
2010
Springer
16 years 21 hour 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...
ECCV
2010
Springer
15 years 10 months ago
Geometry Construction from Caustic Images
In this work we investigate an inverse geometry problem. Given a light source, a diffuse plane and a caustic image, how must a geometric object look like (transmissive or reflect...
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
ECML
2006
Springer
15 years 10 months ago
Transductive Gaussian Process Regression with Automatic Model Selection
Abstract. In contrast to the standard inductive inference setting of predictive machine learning, in real world learning problems often the test instances are already available at ...
Quoc V. Le, Alexander J. Smola, Thomas Gärtne...