Sciweavers

632 search results - page 98 / 127
» On the Approximability of the Steiner Tree Problem
Sort
View

Lecture Notes
443views
15 years 5 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
ECML
2006
Springer
13 years 11 months ago
Task-Driven Discretization of the Joint Space of Visual Percepts and Continuous Actions
We target the problem of closed-loop learning of control policies that map visual percepts to continuous actions. Our algorithm, called Reinforcement Learning of Joint Classes (RLJ...
Sébastien Jodogne, Justus H. Piater
ICML
2005
IEEE
14 years 8 months ago
Closed-form dual perturb and combine for tree-based models
This paper studies the aggregation of predictions made by tree-based models for several perturbed versions of the attribute vector of a test case. A closed-form approximation of t...
Pierre Geurts, Louis Wehenkel
COLING
2008
13 years 9 months ago
Exact Inference for Multi-label Classification using Sparse Graphical Models
This paper describes a parameter estimation method for multi-label classification that does not rely on approximate inference. It is known that multi-label classification involvin...
Yusuke Miyao, Jun-ichi Tsujii
NETWORKS
2010
13 years 6 months ago
Network flow spanners
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
Feodor F. Dragan, Chenyu Yan