Sciweavers

1594 search results - page 91 / 319
» Fast Prediction on a Tree
Sort
View
CGF
2008
83views more  CGF 2008»
13 years 8 months ago
Shallow Bounding Volume Hierarchies for Fast SIMD Ray Tracing of Incoherent Rays
Photorealistic image synthesis is a computationally demanding task that relies on ray tracing for the evaluation of integrals. Rendering time is dominated by tracing long paths th...
Holger Dammertz, Johannes Hanika, Alexander Keller
ICML
1999
IEEE
14 years 9 months ago
The Alternating Decision Tree Learning Algorithm
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
Yoav Freund, Llew Mason
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 8 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
DIS
2006
Springer
13 years 11 months ago
Experiences from a Socio-economic Application of Induction Trees
This paper presents a full scaled application of induction trees for non-classificatory purposes. The grown trees are used for highlighting regional differences in the women's...
Fabio B. Losa, Pau Origoni, Gilbert Ritschard
ICS
2010
Tsinghua U.
14 years 5 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz