Sciweavers

2314 search results - page 9 / 463
» Minimal Partitions of a Graph
Sort
View
TIP
2011
164views more  TIP 2011»
13 years 2 months ago
Multiregion Image Segmentation by Parametric Kernel Graph Cuts
Abstract—The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a ...
Mohamed Ben Salah, Amar Mitiche, Ismail Ben Ayed
PPSC
1997
13 years 8 months ago
A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for message-passing libraries that have high latenc...
George Karypis, Vipin Kumar
JPDC
2007
177views more  JPDC 2007»
13 years 7 months ago
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
Cevdet Aykanat, Berkant Barla Cambazoglu, Ferit Fi...
VLSID
2003
IEEE
167views VLSI» more  VLSID 2003»
14 years 7 months ago
Timing Minimization by Statistical Timing hMetis-based Partitioning
In this paper we present statistical timing driven hMetisbased partitioning. We approach timing driven partitioning from a different perspective: we use the statistical timing cri...
Cristinel Ababei, Kia Bazargan
AAAI
2007
13 years 9 months ago
Graph Partitioning Based on Link Distributions
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu