970 search results - page 47 / 194 » On encodings of spanning trees |
IMCSIT
2010
13 years 3 months ago
2010
NIPS
2008
13 years 10 months ago
2008
Given an n-vertex weighted tree with structural diameter S and a subset of m vertices, we present a technique to compute a corresponding m
ALPIT
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper proposes a Unified Dynamic Relation Tree (DRT) span for tree kernel-based semantic relation extraction between entity names. The basic idea is to apply a variety of lin...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
AAAI
2006
13 years 10 months ago
2006
In this paper, we study the classification problem involving information spanning multiple private databases. The privacy challenges lie in the facts that data cannot be collected...