Sciweavers

2079 search results - page 324 / 416
» Universality of random graphs
Sort
View
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
16 years 1 months ago
Detecting Communities in Social Networks Using Max-Min Modularity.
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
Jiyang Chen, Osmar R. Zaïane, Randy Goebel
CVPR
2010
IEEE
16 years 12 days ago
A Diffusion Approach to Seeded Image Segmentation
Seeded image segmentation is a popular type of supervised image segmentation in computer vision and image processing. Previous methods of seeded image segmentation treat the image...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
WWW
2010
ACM
15 years 11 months ago
SourceRank: relevance and trust assessment for deep web sources based on inter-source agreement
We consider the problem of deep web source selection and argue that existing source selection methods are inadequate as they are based on local similarity assessment. Specificall...
Raju Balakrishnan, Subbarao Kambhampati
FOCS
2009
IEEE
15 years 11 months ago
Regularity Lemmas and Combinatorial Algorithms
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
Nikhil Bansal, Ryan Williams
INFOCOM
2009
IEEE
15 years 11 months ago
Delay Guarantees for Throughput-Optimal Wireless Link Scheduling
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
Koushik Kar, Xiang Luo, Saswati Sarkar