Sciweavers

5699 search results - page 139 / 1140
» Alternating model trees
Sort
View
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
16 years 5 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
157
Voted
CP
1997
Springer
15 years 8 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...
VLDB
1992
ACM
111views Database» more  VLDB 1992»
15 years 8 months ago
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
In this paper, we explore the execution of pipelined hash joins in a multiprocessor-based database system. To improve the query execution, an innovative approach on query executio...
Ming-Syan Chen, Ming-Ling Lo, Philip S. Yu, Honest...
154
Voted
CORR
2004
Springer
118views Education» more  CORR 2004»
15 years 4 months ago
Understanding Search Trees via Statistical Physics
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
Satya N. Majumdar, David S. Dean, Paul L. Krapivsk...
IPPS
1998
IEEE
15 years 8 months ago
A Survey of Randomness and Parallelism in Comparison Problems
A survey of results for the problems of selection, mergingand sorting in the Randomized Parallel Comparison Tree RPCT model is given. The results indicate that while randomization ...
Danny Krizanc