Sciweavers

266 search results - page 12 / 54
» On the variance of random polygons
Sort
View
IMAMS
2003
212views Mathematics» more  IMAMS 2003»
15 years 1 months ago
Watermarking 3D Polygonal Meshes Using the Singular Spectrum Analysis
Watermarking is to embed a structure called a watermark into the target data such as images. The watermark can be used, for example, in order to secure the copyright and detect tam...
Kohei Muratani, Kokichi Sugihara
NIPS
1998
15 years 1 months ago
A Polygonal Line Algorithm for Constructing Principal Curves
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
Balázs Kégl, Adam Krzyzak, Tam&aacut...
SIGGRAPH
1996
ACM
15 years 3 months ago
Consequences of Stratified Sampling in Graphics
Antialiased pixel values are often computed as the mean of N point samples. Using uniformly distributed random samples, the central limit theorem predicts a variance of the mean o...
Don P. Mitchell
DCG
2008
110views more  DCG 2008»
14 years 11 months ago
An Inscribing Model for Random Polytopes
For convex bodies K with C2 boundary in Rd, we explore random polytopes with vertices chosen along the boundary of K. In particular, we determine asymptotic properties of the volum...
Ross M. Richardson, Van H. Vu, Lei Wu
CPC
2008
65views more  CPC 2008»
14 years 11 months ago
The Distribution of Patterns in Random Trees
Let Tn denote the set of unrooted labeled trees of size n and let M be a particular (finite, unlabeled) tree. Assuming that every tree of Tn is equally likely, it is shown that the...
Frédéric Chyzak, Michael Drmota, Tho...