1963 search results - page 121 / 393 » The Maximum Solution Problem on Graphs |
155
Voted
EMMCVPR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
159
Voted
MOBICOM
2006
ACM
15 years 8 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
130
click to vote
ICPP
2005
IEEE
15 years 8 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
131
Voted
GLOBECOM
2010
IEEE
15 years 16 days ago
2010
IEEE
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division mult...
120
Voted
STOC
2010
ACM
15 years 12 months ago
2010
ACM
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...