Sciweavers

3894 search results - page 482 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ICML
2009
IEEE
16 years 5 months ago
Large margin training for hidden Markov models with partially observed states
Large margin learning of Continuous Density HMMs with a partially labeled dataset has been extensively studied in the speech and handwriting recognition fields. Yet due to the non...
Thierry Artières, Trinh Minh Tri Do
DGCI
2005
Springer
15 years 10 months ago
Uncertain Geometry in Computer Vision
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...
Peter Veelaert
ESA
2003
Springer
90views Algorithms» more  ESA 2003»
15 years 9 months ago
Packing a Trunk
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
Friedrich Eisenbrand, Stefan Funke, Joachim Reiche...
AAAI
1997
15 years 5 months ago
Effective Redundant Constraints for Online Scheduling
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
Lise Getoor, Greger Ottosson, Markus P. J. Fromher...
ML
2008
ACM
152views Machine Learning» more  ML 2008»
15 years 4 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...