778 search results - page 37 / 156 » Bounding Smooth Integers |
APAL
2010
13 years 7 months ago
2010
We discover geometric properties of certain definable sets over non-Archimedean valued fields with analytic structures. Results include a parameterized smooth stratification theore...
JMLR
2012
11 years 10 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
UAI
2008
13 years 9 months ago
2008
Confidence measures for the generalization error are crucial when small training samples are used to construct classifiers. A common approach is to estimate the generalization err...
SCALESPACE
2007
Springer
14 years 1 months ago
2007
Springer
The reconstruction problem is usually formulated as a variational problem in which one searches for that image that minimizes a so called prior (image model) while insisting on cer...
DCG
2011
13 years 2 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...