1722 search results - page 16 / 345 » On the sample mean of graphs |
SIGGRAPH
1996
ACM
15 years 2 months ago
1996
ACM
Antialiased pixel values are often computed as the mean of N point samples. Using uniformly distributed random samples, the central limit theorem predicts a variance of the mean o...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
WSC
2004
14 years 11 months ago
2004
In the analysis of a manufacturing system, the analyst is often interested in the change in mean cycle time as a function of different throughput (start rate) levels. Since the va...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
JMLR
2006
14 years 10 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...