Sciweavers

1952 search results - page 53 / 391
» Complete partitions of graphs
Sort
View
JDA
2008
94views more  JDA 2008»
13 years 10 months ago
Approximability of partitioning graphs with supply and demand
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...
CVPR
2012
IEEE
12 years 18 days ago
Segmentation using superpixels: A bipartite graph partitioning approach
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...
Zhenguo Li, Xiao-Ming Wu, Shih-Fu Chang
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
14 years 12 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
PAMI
2006
226views more  PAMI 2006»
13 years 10 months ago
Graph Partitioning Active Contours (GPAC) for Image Segmentation
In this paper we introduce new type of variational segmentation cost functions and associated active contour methods that are based on pairwise similarities or dissimilarities of t...
Baris Sumengen, B. S. Manjunath
IPPS
2007
IEEE
14 years 4 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