Sciweavers

4838 search results - page 2 / 968
» Sampling of information goods
Sort
View
DKE
2006
67views more  DKE 2006»
13 years 5 months ago
Indexed-based density biased sampling for clustering applications
Density biased sampling (DBS) has been proposed to address the limitations of Uniform sampling, by producing the desired probability distribution in the sample. The ease of produc...
Alexandros Nanopoulos, Yannis Theodoridis, Yannis ...
IJCAI
2007
13 years 6 months ago
From Sampling to Model Counting
We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previ...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...
ECCC
2010
95views more  ECCC 2010»
13 years 5 months ago
Bounded-depth circuits cannot sample good codes
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
Shachar Lovett, Emanuele Viola
COMPGEOM
2006
ACM
13 years 11 months ago
Provably good sampling and meshing of Lipschitz surfaces
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...
Jean-Daniel Boissonnat, Steve Oudot
SGP
2003
13 years 6 months ago
Provably Good Surface Sampling and Approximation
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
Steve Oudot, Jean-Daniel Boissonnat