628 search results - page 79 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
144
click to vote
EMNLP
2010
15 years 1 months ago
2010
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
155
click to vote
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
156
click to vote
FSTTCS
1993
Springer
15 years 7 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
120
click to vote
PDPTA
2003
15 years 4 months ago
2003
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
139
click to vote
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...