Sciweavers

1594 search results - page 21 / 319
» Fast Prediction on a Tree
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 6 months ago
Fast Self-Stabilizing Minimum Spanning Tree Construction
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
Lélia Blin, Shlomi Dolev, Maria Potop-Butuc...
EGH
2009
Springer
13 years 5 months ago
Fast minimum spanning tree for large graphs on the GPU
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
Vibhav Vineet, Pawan Harish, Suryakant Patidar, P....
IRI
2007
IEEE
14 years 2 months ago
Software Defects Prediction using Operating Characteristic Curves
We present a software defect prediction model using operating characteristic curves. The main idea behind our proposed technique is to use geometric insight in helping construct a...
Torsten Bergander, Yan Luo, A. Ben Hamza
ICCV
2001
IEEE
14 years 9 months ago
Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree
Yong-Sheng Chen, Yi-Ping Hung, Chiou-Shann Fuh
ICPR
2006
IEEE
14 years 9 months ago
Metric tree partitioning and Taylor approximation for fast support vector classification
This paper presents a method to speed up support vector classification, especially important when data is highdimensional. Unlike previous approaches which focus on less support v...
Thang V. Pham, Arnold W. M. Smeulders