Sciweavers

1503 search results - page 83 / 301
» Self-optimizing distributed trees
Sort
View
IPPS
1999
IEEE
14 years 2 months ago
Parallel Out-of-Core Divide-and-Conquer Techniques with Application to Classification Trees
Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. D...
Mahesh K. Sreenivas, Khaled Alsabti, Sanjay Ranka
IPPS
1998
IEEE
14 years 2 months ago
Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
Vincenzo Auletta, Sajal K. Das, Amelia De Vivo, Ma...
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
13 years 11 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens
VMV
2008
107views Visualization» more  VMV 2008»
13 years 11 months ago
Learning with Few Examples using a Constrained Gaussian Prior on Randomized Trees
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
Erik Rodner, Joachim Denzler
HPCC
2010
Springer
13 years 11 months ago
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-Grained Parallelism
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
Stefan Marr, Stijn Verhaegen, Bruno De Fraine, The...