4972 search results - page 757 / 995 » Ranking on graph data |
176
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
201
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
198
click to vote
MM
2009
ACM
16 years 1 months ago
2009
ACM
We propose a novel technique for semi-supervised image annotation which introduces a harmonic regularizer based on the graph Laplacian of the data into the probabilistic semantic ...
164
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
179
click to vote
HICSS
2008
IEEE
16 years 1 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...