365 search results - page 33 / 73 » On the Crossing Spanning Tree Problem |
163
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
127
click to vote
ICIP
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
147
click to vote
COLING
2010
14 years 11 months ago
2010
In this paper we address methodological issues in the evaluation of a projectionbased framework for dependency parsing in which annotations for a source language are transfered to...
156
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
138
Voted
EUC
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Well-scheduled communications, in conjunction with the aggregation of data reduce the energy waste on idle listening and redundant transmissions. In addition, the adjusta...