Sciweavers

1185 search results - page 1 / 237
» The Equivalence of Sampling and Searching
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 4 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
ISCAS
2003
IEEE
127views Hardware» more  ISCAS 2003»
13 years 10 months ago
Nonuniform sampling driver design for optimal ADC utilization
Deliberate nonuniform sampling promises increased equivalent sampling rates with reduced overall hardware costs of the DSP system. The equivalent sampling rate is the sampling rat...
Frank Papenfuss, Yuri Artyukh, E. Boole, Dirk Timm...
CVPR
1998
IEEE
14 years 6 months ago
The Sample Tree: A Sequential Hypothesis Testing Approach to 3D Object Recognition
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
Michael A. Greenspan
JMLR
2002
102views more  JMLR 2002»
13 years 4 months ago
Optimal Structure Identification With Greedy Search
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
David Maxwell Chickering
AI
2011
Springer
12 years 11 months ago
SampleSearch: Importance sampling in presence of determinism
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
Vibhav Gogate, Rina Dechter