144 search results - page 4 / 29 » Sampling Techniques for Large, Dynamic Graphs |
ICML
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
ICDE
2006
IEEE
14 years 11 months ago
2006
IEEE
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
JDA
2006
13 years 9 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
PAKDD
2010
ACM
14 years 2 months ago
2010
ACM
In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
VLDB
2005
ACM
14 years 3 months ago
2005
ACM
Emerging data stream management systems approach the challenge of massive data distributions which arrive at high speeds while there is only small storage by summarizing and minin...