830 search results - page 50 / 166 » Route kernels for trees |
148
click to vote
COLING
2010
14 years 11 months ago
2010
We present novel kernels based on structured and unstructured features for reranking the N-best hypotheses of conditional random fields (CRFs) applied to entity extraction. The fo...
115
Voted
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
129
Voted
ICCAD
1995
IEEE
15 years 7 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...
139
click to vote
TON
2002
15 years 3 months ago
2002
Abstract--This paper addresses multicast routing in circuitswitched multihop optical networks employing wavelength-division multiplexing. We consider a model in which multicast com...
159
click to vote
CCIA
2005
Springer
15 years 6 months ago
2005
Springer
This work presents a new multiobjective algorithm based on ant colonies, which is used in the construction of the multicast tree for data transmission in a computer network. The pr...