Sciweavers

933 search results - page 173 / 187
» Centrality Estimation in Large Networks
Sort
View
PVLDB
2010
220views more  PVLDB 2010»
14 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
WSDM
2010
ACM
199views Data Mining» more  WSDM 2010»
15 years 7 months ago
A Sketch-Based Distance Oracle for Web-Scale Graphs
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork,...
69
Voted
ATAL
2009
Springer
15 years 4 months ago
Analyzing the performance of randomized information sharing
In large, collaborative, heterogeneous teams, team members often collect information that is useful to other members of the team. Recognizing the utility of such information and d...
Prasanna Velagapudi, Oleg A. Prokopyev, Katia P. S...
70
Voted
IPPS
2008
IEEE
15 years 4 months ago
Scalable data dissemination using hybrid methods
Web server scalability can be greatly enhanced via hybrid data dissemination methods that use both unicast and multicast. Hybrid data dissemination is particularly promising due t...
Wenhui Zhang, Vincenzo Liberatore, Jonathan Beaver...
SOCC
2008
IEEE
106views Education» more  SOCC 2008»
15 years 4 months ago
Nanoscale on-chip decoupling capacitors
— A distributed on-chip decoupling capacitor network is proposed in this paper to replace one large capacitor. A system of distributed on-chip decoupling capacitors is shown to p...
Mikhail Popovich, Eby G. Friedman