1640 search results - page 54 / 328 » Conditional Independence Trees |
179
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
152
click to vote
JCT
2006
15 years 6 months ago
2006
Graham and Pollak (Bell System Tech. J. 50 (1971) 2495-2519) obtained a beautiful formula on the determinant of distance matrices of trees, which is independent of the structure o...
152
click to vote
WOLLIC
2007
Springer
16 years 20 days ago
2007
Springer
Hydra games were introduced by Kirby and Paris, for the formulation of a result which is independent from Peano arithmetic but depends on the transfinite structure of 0. Tree ordi...
136
click to vote
FEGC
2008
15 years 8 months ago
2008
We propose a way of extracting high-confidence association rules from datasets consisting of unlabeled trees. The antecedents are obtained through a computation akin to a hypergrap...
309
click to vote
ICANN
2011
Springer
14 years 10 months ago
2011
Springer
The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are con...