16430 search results - page 278 / 3286 » On Computable Tree Functions |
141
click to vote
EOR
2008
15 years 4 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
153
Voted
ECML
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Tree induction methods and linear models are popular techniques for supervised learning tasks, both for the prediction of nominal classes and continuous numeric values. F...
127
click to vote
SODA
2007
ACM
15 years 6 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
141
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
107
Voted
ICCBR
2009
Springer
15 years 11 months ago
2009
Springer
In forestry, it is important to be able to accurately determine the volume of timber in a harvesting site and the products that could potentially be produced from that timber. We d...