785 search results - page 43 / 157 » Binary Join Trees |
COMBINATORICS
2006
14 years 9 months ago
2006
Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree T , there is a set of four characters that define T . Here we deal with the general ca...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
We introduce a framework, which we call Divide-by-2 (DB2), for extending support vector machines (SVM) to multi-class problems. DB2 offers an alternative to the standard one-again...
STACS
1999
Springer
15 years 2 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
AAAI
2004
14 years 11 months ago
2004
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...