144 search results - page 3 / 29 » Sampling Techniques for Large, Dynamic Graphs |
DAC
2000
ACM
14 years 6 months ago
2000
ACM
Variable ordering for BDDs has been extensively investigated. Recently, sampling based ordering techniques have been proposed to overcome problems with structure based static orde...
VLDB
2004
ACM
13 years 10 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
CORR
2011
Springer
13 years 12 days ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
WSCG
2004
13 years 6 months ago
2004
In this paper we present a new technique for rendering very large datasets representing point-sampled surfaces. Rendering efficiency is considerably improved by using stochastic s...
INFOCOM
2009
IEEE
14 years 1 days ago
2009
IEEE
—This paper presents Respondent-Driven Sampling (RDS) as a promising technique to derive unbiased estimates of node properties in unstructured overlay networks such as Gnutella. ...