778 search results - page 60 / 156 » Bounding Smooth Integers |
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
In the last decade, a great deal of work has been devoted to the elaboration of a sampling theory for smooth surfaces. The goal was to ensure a good reconstruction of a given surf...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The problem of joint universal source coding and modeling, addressed by Rissanen in the context of lossless codes, is generalized to fixed-rate lossy coding of continuousalphabet m...
JAT
2006
13 years 7 months ago
2006
The supremum over all knot sequences of the max-norm of the orthogonal spline projector is studied with respect to the order k of the splines and their smoothness. It is first bou...
TIT
2008
2008
Joint Fixed-Rate Universal Lossy Coding and Identification of Continuous-Alphabet Memoryless Sources
13 years 7 months ago
Abstract--The problem of joint universal source coding and density estimation is considered in the setting of fixed-rate lossy coding of continuous-alphabet memoryless sources. For...