2004 search results - page 29 / 401 » Sampling from large graphs |
103
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
ICMCS
2000
IEEE
15 years 4 months ago
2000
IEEE
Manipulating digital video using desktop computers, especially in uncompressed form, and communicating it over networks can be time-consuming because of it large bandwidth require...
ICML
2007
IEEE
16 years 16 days ago
2007
IEEE
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
137
click to vote
GD
1998
Springer
15 years 4 months ago
1998
Springer
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
104
click to vote
SDM
2007
SIAM
15 years 1 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...