Sciweavers

1594 search results - page 80 / 319
» Fast Prediction on a Tree
Sort
View
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
13 years 11 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher
SI3D
1995
ACM
13 years 11 months ago
Shadow Volume BSP Trees for Computation of Shadows in Dynamic Scenes
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...
Yiorgos Chrysanthou, Mel Slater
CSL
2007
Springer
14 years 2 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart
ECML
2003
Springer
14 years 1 months ago
Logistic Model Trees
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...
Niels Landwehr, Mark Hall, Eibe Frank
DIS
2008
Springer
13 years 9 months ago
Empirical Asymmetric Selective Transfer in Multi-objective Decision Trees
We consider learning tasks where multiple target variables need to be predicted. Two approaches have been used in this setting: (a) build a separate single-target model for each ta...
Beau Piccart, Jan Struyf, Hendrik Blockeel