Sciweavers

125 search results - page 9 / 25
» The Stochastic Machine Replenishment Problem
Sort
View
ECML
2006
Springer
14 years 1 months ago
Learning Stochastic Tree Edit Distance
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...
Marc Bernard, Amaury Habrard, Marc Sebban
ECIR
2010
Springer
13 years 7 months ago
Maximum Margin Ranking Algorithms for Information Retrieval
Abstract. Machine learning ranking methods are increasingly applied to ranking tasks in information retrieval (IR). However ranking tasks in IR often differ from standard ranking t...
Shivani Agarwal, Michael Collins
ICML
2009
IEEE
14 years 4 months ago
Fast evolutionary maximum margin clustering
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...
Fabian Gieseke, Tapio Pahikkala, Oliver Kramer
ICML
2006
IEEE
14 years 10 months ago
Qualitative reinforcement learning
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
Arkady Epshteyn, Gerald DeJong
ICPR
2010
IEEE
14 years 7 days ago
Fast Training of Object Detection Using Stochastic Gradient Descent
Training datasets for object detection problems are typically very large and Support Vector Machine (SVM) implementations are computationally complex. As opposed to these complex ...
Rob Wijnhoven, Peter H. N. De With