10 search results - page 1 / 2 » Random Graphs And The Strong Convergence Of Bootstrap Means |
CPC
2000
13 years 4 months ago
2000
COLT
2004
Springer
13 years 9 months ago
2004
Springer
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
ESA
2005
Springer
13 years 9 months ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
AMAI
2004
Springer
13 years 9 months ago
2004
Springer
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
FOCS
1993
IEEE
13 years 8 months ago
1993
IEEE
Learnability in Valiant’s PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free conver...