1722 search results - page 49 / 345 » On the sample mean of graphs |
63
Voted
IWC
2011
14 years 5 months ago
2011
The selection of users for participation in IT projects involves trade-offs between multiple criteria, one of which is selecting a representative cross-section of users. This crite...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...
BIOCOMP
2008
14 years 11 months ago
2008
In this paper we introduce a novel approach for the analysis of microarray titration experiments. The test introduced here can be used more generally for drug-dosage effect or time...
BIOCOMP
2007
14 years 11 months ago
2007
— This paper describes graph-based relational, unsupervised learning algorithm to infer node replacement graph grammar and its application to metabolic pathways. We search for fr...
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
In this paper, we study the problem of how to generate synthetic graphs matching various properties of a real social network with two applications, privacy preserving social netwo...