1798 search results - page 53 / 360 » A Tree for All Seasons |
ICANN
2011
Springer
13 years 8 days 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...
DCOSS
2006
Springer
14 years 15 days ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
FAW
2009
Springer
14 years 3 months ago
2009
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...
DM
2007
13 years 8 months ago
2007
For a tree T and an integer k ≥ 1, it is well known that the k-th power T k of T is strongly chordal and hence has a strong elimination ordering of its vertices. In this note we...
CPAIOR
2007
Springer
14 years 3 months ago
2007
Springer
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...