Sciweavers

151 search results - page 26 / 31
» Edge Anonymity in Social Network Graphs
Sort
View
CORR
2011
Springer
217views Education» more  CORR 2011»
13 years 1 months ago
Coarse-Grained Topology Estimation via Graph Sampling
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
Maciej Kurant, Minas Gjoka, Yan Wang, Zack W. Almq...
JAT
2010
109views more  JAT 2010»
13 years 8 months ago
Networks of polynomial pieces with application to the analysis of point clouds and images
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
Ery Arias-Castro, Boris Efros, Ofer Levi
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
14 years 10 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
JSAI
2001
Springer
14 years 2 months ago
A Document as a Small World
The small world topology is known widespread in biological, social and man-made systems. This paper shows that the small world structure also exists in documents, such as papers. A...
Yutaka Matsuo, Yukio Ohsawa, Mitsuru Ishizuka
PVLDB
2010
220views more  PVLDB 2010»
13 years 4 months ago
Fast Incremental and Personalized PageRank
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel