139 search results - page 17 / 28 » A New Algorithm for Multi-objective Graph Partitioning |
WEA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
DAC
2004
ACM
14 years 9 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
GD
1998
Springer
14 years 4 days ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
3DPVT
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper proposes a new framework to image segmentation which combines edge- and region-based information with spectral techniques through the morphological algorithm of watersh...