Sciweavers

274 search results - page 10 / 55
» On Random Sampling over Joins
Sort
View
STACS
2009
Springer
15 years 9 months ago
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
Mahdi Cheraghchi, Amin Shokrollahi
EDBT
2010
ACM
135views Database» more  EDBT 2010»
15 years 8 months ago
Probabilistic ranking over relations
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin
UAI
2003
15 years 6 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
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
16 years 5 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
RT
2005
Springer
15 years 10 months ago
Metropolis Photon Sampling with Optional User Guidance
We present Metropolis Photon Sampling (MPS), a visual importance-driven algorithm for populating photon maps. Photon Mapping and other particle tracing algorithms fail if the phot...
Shaohua Fan, Stephen Chenney, Yu-chi Lai