1640 search results - page 3 / 328 » Conditional Independence Trees |
ISIPTA
1999
IEEE
13 years 10 months ago
1999
IEEE
The aim of this paper is to survey and brie y discuss various rules of conditioning proposed in the framework of possibility theory as well as various conditional independence rel...
TSP
2010
13 years 14 days ago
2010
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
SIAMCOMP
2002
13 years 5 months ago
2002
We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recur...
AAAI
2006
13 years 7 months ago
2006
There is growing interest in scaling up the widely-used decision-tree learning algorithms to very large data sets. Although numerous diverse techniques have been proposed, a fast ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...