Sciweavers

6251 search results - page 844 / 1251
» Randomness, Computability, and Density
Sort
View
WSCG
2004
111views more  WSCG 2004»
15 years 9 months ago
Natural Lighting of Vegetation based on Polar Planes
We present a lighting method for outdoor scenes with vegetation. The method is compatible with multiresolution trees generated using random L-systems. We include a sky dome model ...
Maria J. Vicent, Javier Lluch, Roberto Vivó
NIPS
1998
15 years 9 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...
UAI
1998
15 years 9 months ago
Large Deviation Methods for Approximate Probabilistic Inference
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...
Michael J. Kearns, Lawrence K. Saul
WSC
1998
15 years 9 months ago
Bootstrapping and Validation of Metamodels in Simulation
Bootstrapping is a resampling technique that requires less computer time than simulation does. Bootstrapping -like simulation-must be defined for each type of application. This pa...
Jack P. C. Kleijnen, A. J. Feelders, Russell C. H....
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
15 years 9 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan