600 search results - page 6 / 120 » Problems and results in extremal combinatorics - II |
COMBINATORICS
2006
13 years 7 months ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
COMBINATORICS
2000
13 years 6 months ago
2000
We study the limiting distribution of the height in a generalized trie in which external nodes are capable to store up to b items (the so called b-tries). We assume that such a tr...
ML
2006
ACM
13 years 7 months ago
2006
ACM
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
JMIV
2006
13 years 7 months ago
2006
In this paper, we describe how to use geodesic energies defined on various sets of objects to solve several distance related problems. We first present the theory of metamorphoses ...
TSP
2010
13 years 1 months ago
2010
The problem of learning tree-structured Gaussian graphical models from independent and identically distributed (i.i.d.) samples is considered. The influence of the tree structure a...