Sciweavers

160 search results - page 5 / 32
» Towards effective partition management for large graphs
Sort
View
ICC
2008
IEEE
127views Communications» more  ICC 2008»
15 years 4 months ago
On the Devolution of Large-Scale Sensor Networks in the Presence of Random Failures
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
Fei Xing, Wenye Wang
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
CVPR
2012
IEEE
13 years 10 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
SIGCOMM
2009
ACM
15 years 4 months ago
Towards automated performance diagnosis in a large IPTV network
IPTV is increasingly being deployed and offered as a commercial service to residential broadband customers. Compared with traditional ISP networks, an IPTV distribution network (i...
Ajay Anil Mahimkar, Zihui Ge, Aman Shaikh, Jia Wan...
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
15 years 10 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...