2004 search results - page 33 / 401 » Sampling from large graphs |
102
click to vote
SDM
2007
SIAM
15 years 1 months ago
2007
SIAM
How do blogs cite and influence each other? How do such links evolve? Does the popularity of old blog posts drop exponentially with time? These are some of the questions that we ...
169
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
129
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
A study of generalization error in signal detection by multiple spatially-distributed and -correlated sensors is provided when the detection rule is learned from a finite number ...
SAC
2009
ACM
15 years 6 months ago
2009
ACM
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
117
click to vote
COMBINATORICS
1998
14 years 11 months ago
1998
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...