1163 search results - page 114 / 233 » Embedding into Bipartite Graphs |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
SAS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
ASAP
2000
IEEE
14 years 17 days ago
2000
IEEE
This paper explores the problem of efficiently ordering interprocessor communication operations in statically-scheduled multiprocessors for iterative dataflow graphs. In most digi...
ICCV
2011
IEEE
12 years 8 months ago
2011
IEEE
We present a new framework in which image segmentation, figure/ground organization, and object detection all appear as the result of solving a single grouping problem. This frame...
JGT
2007
13 years 8 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...