1722 search results - page 134 / 345 » On the sample mean of graphs |
179
click to vote
INFOCOM
2008
IEEE
16 years 23 days ago
2008
IEEE
Abstract—Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measuremen...
156
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
166
click to vote
COLT
2005
Springer
15 years 12 months ago
2005
Springer
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...
162
click to vote
ESM
2000
15 years 7 months ago
2000
The classical method of evaluation of simulations surely is the batch means method, see e.g. [Bratley et al. 1987], giving confidence intervals to express the precision of the sim...
138
click to vote
QUESTA
2010
15 years 4 months ago
2010
The M/G/K queueing system is one of the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coar...