Sciweavers

103 search results - page 5 / 21
» Graph partitioning using single commodity flows
Sort
View
DCG
2002
66views more  DCG 2002»
14 years 9 months ago
Generation of Oriented Matroids - A Graph Theoretical Approach
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretica...
Lukas Finschi, Komei Fukuda
IPPS
2007
IEEE
15 years 3 months ago
Incorporating Latency in Heterogeneous Graph Partitioning
Parallel applications based on irregular meshes make use of mesh partitioners for efficient execution. Some mesh partitioners can map a mesh to a heterogeneous computational plat...
Eric E. Aubanel, Xiaochen Wu
CCGRID
2005
IEEE
14 years 11 months ago
The Composite Endpoint Protocol (CEP): scalable endpoints for terabit flows
We introduce the Composite Endpoint Protocol (CEP) which efficiently composes a set of transmission elements to support high speed flows which exceed the capabilities of a single...
Eric Weigle, Andrew A. Chien
ICIP
2010
IEEE
14 years 7 months ago
Image partitioning with kernel mapping and graph cuts
A novel multiregion graph cut image partitioning method combined with kernel mapping is presented. A kernel function transforms implicitly the image data into data of a higher dim...
Mohamed Ben Salah, Amar Mitiche, Ismail Ben Ayed
ICASSP
2009
IEEE
15 years 4 months ago
Exploiting T-junctions for depth segregation in single images
Occlusion is one of the major consequences of the physical image generation process: it occurs when an opaque object partly obscures the view of another object further away from t...
Mariella Dimiccoli, Philippe Salembier