Sciweavers

1578 search results - page 233 / 316
» Algorithmic randomness of continuous functions
Sort
View
UAI
2003
13 years 10 months ago
An Empirical Study of w-Cutset Sampling for Bayesian Networks
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
Bozhena Bidyuk, Rina Dechter
IPL
2006
89views more  IPL 2006»
13 years 8 months ago
Adaptive general perfectly periodic scheduling
We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known...
Shailesh Patil, Vijay K. Garg
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 9 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
ICCV
2003
IEEE
14 years 10 months ago
Regression based Bandwidth Selection for Segmentation using Parzen Windows
We consider the problem of segmentation of images that can be modelled as piecewise continuous signals having unknown, non-stationary statistics. We propose a solution to this pro...
Maneesh Kumar Singh, Narendra Ahuja
VIS
2008
IEEE
154views Visualization» more  VIS 2008»
14 years 10 months ago
Volume MLS Ray Casting
The method of Moving Least Squares (MLS) is a popular framework for reconstructing continuous functions from scattered data due to its rich mathematical properties and well-underst...
Christian Ledergerber, Gaël Guennebaud, Miriah ...