Sciweavers

4137 search results - page 98 / 828
» On the number of matchings of a tree
Sort
View
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
15 years 12 months ago
Effective Estimation of Posterior Probabilities: Explaining the Accuracy of Randomized Decision Tree Approaches
There has been increasing number of independently proposed randomization methods in different stages of decision tree construction to build multiple trees. Randomized decision tre...
Wei Fan, Ed Greengrass, Joe McCloskey, Philip S. Y...
IJCAI
1993
15 years 7 months ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga
AHSWN
2008
92views more  AHSWN 2008»
15 years 6 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
SIAMDM
2008
99views more  SIAMDM 2008»
15 years 6 months ago
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees
We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...
Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer
CVPR
2010
IEEE
16 years 2 months ago
A Constant-Space Belief Propagation Algorithm for Stereo Matching
In this paper, we consider the problem of stereo matching using loopy belief propagation. Unlike previous methods which focus on the original spatial resolution, we hierarchically...
Qingxiong Yang, Liang Wang, Narendra Ahuja