3247 search results - page 6 / 650 » Randomized smoothing networks |
78
Voted
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
JC
2006
14 years 9 months ago
2006
We study the information complexity in the randomized setting of solving a general elliptic PDE of order 2m in a smooth, bounded domain Q Rd with smooth coefficients and homogene...
SODA
2010
ACM
15 years 6 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
JC
2008
14 years 9 months ago
2008
We study the complexity of randomized solution of initial value problems for systems of ordinary differential equations (ODE). The input data are assumed to be -smooth ( = r+ : th...
LCN
2007
IEEE
15 years 3 months ago
2007
IEEE