Sciweavers

341 search results - page 10 / 69
» Paired bondage in trees
Sort
View
SIAMDM
2008
100views more  SIAMDM 2008»
14 years 9 months ago
Tree-Related Widths of Graphs and Hypergraphs
A hypergraph pair is a pair (G, H) where G and H are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [7] and generalised hypertree-width [8] ...
Isolde Adler
TSP
2010
14 years 4 months ago
Learning Gaussian tree models: analysis of error exponents and extremal structures
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...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
ACL
2010
14 years 7 months ago
Exploring Syntactic Structural Features for Sub-Tree Alignment Using Bilingual Tree Kernels
We propose Bilingual Tree Kernels (BTKs) to capture the structural similarities across a pair of syntactic translational equivalences and apply BTKs to sub-tree alignment along wi...
Jun Sun, Min Zhang, Chew Lim Tan
ICDAR
2003
IEEE
15 years 2 months ago
Binary Classification Trees for Multi-class Classification Problems
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...
Jin-Seon Lee, Il-Seok Oh
88
Voted
LICS
2010
IEEE
14 years 7 months ago
Recursion Schemes and Logical Reflection
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...