Sciweavers

376 search results - page 57 / 76
» Completely connected clustered graphs
Sort
View
INFOCOM
2011
IEEE
12 years 11 months ago
A distributed and privacy preserving algorithm for identifying information hubs in social networks
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...
Muhammad Usman Ilyas, Muhammad Zubair Shafiq, Alex...
AHSWN
2008
92views more  AHSWN 2008»
13 years 7 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
VLDB
2004
ACM
143views Database» more  VLDB 2004»
14 years 1 months ago
GPX: Interactive Mining of Gene Expression Data
Discovering co-expressed genes and coherent expression patterns in gene expression data is an important data analysis task in bioinformatics research and biomedical applications. ...
Daxin Jiang, Jian Pei, Aidong Zhang
CN
2004
114views more  CN 2004»
13 years 7 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford
CVPR
2010
IEEE
14 years 4 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...