Sciweavers

1594 search results - page 18 / 319
» Fast Prediction on a Tree
Sort
View
ICML
1998
IEEE
16 years 16 days ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour
ISM
2008
IEEE
83views Multimedia» more  ISM 2008»
15 years 6 months ago
Fast and Flexible Tree Rendering with Enhanced Visibility Estimation
We present a set of techniques to simplify tree models for faster rendering while retaining their visual resemblance to the original model. This goal is achieved by setting a budg...
Jessy Lee, C. C. Jay Kuo
3DOR
2009
14 years 9 months ago
SkelTre - Fast Skeletonisation for Imperfect Point Cloud Data of Botanic Trees
Terrestrial laser scanners capture 3D geometry as a point cloud. This paper reports on a new algorithm aiming at the skeletonisation of a laser scanner point cloud, representing a...
Alexander Bucksch, Roderik C. Lindenbergh, Massimo...
EOR
2008
107views more  EOR 2008»
14 years 11 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
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...
Alysson M. Costa, Jean-François Cordeau, Gi...
ECCV
2006
Springer
16 years 1 months ago
A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
Yi Deng, Xueyin Lin