373 search results - page 3 / 75 » Nearness and uniform convergence |
JMLR
2010
12 years 12 months ago
2010
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...
FOCS
1993
IEEE
13 years 9 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...
COLT
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. The regularization functional induced by the graph Laplacian of a random neighborhood graph based on the data is adaptive in two ways. First it adapts to an underlying ma...
DCG
2010
13 years 5 months ago
2010
We study discrete curvatures computed from nets of curvature lines on a given smooth surface and prove their uniform convergence to smooth principal curvatures. We provide explicit...
MOC
2000
13 years 5 months ago
2000
The mortar finite element is an example of a non-conforming method which can be used to decompose and re-compose a domain into subdomains without requiring compatibility between th...