Sciweavers

545 search results - page 42 / 109
» Estimating the Probability of Approximate Matches
Sort
View
WSC
2004
15 years 7 months ago
A Large Deviations Perspective on Ordinal Optimization
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...
Peter W. Glynn, Sandeep Juneja
TR
2010
128views Hardware» more  TR 2010»
15 years 26 days ago
Strategy for Planning Accelerated Life Tests With Small Sample Sizes
Previous work on planning accelerated life tests has been based on large-sample approximations to evaluate test plan properties. In this paper, we use more accurate simulation met...
Haiming Ma, William Q. Meeker
FOCS
2007
IEEE
16 years 15 days ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 1 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
TIP
2010
129views more  TIP 2010»
15 years 26 days ago
Image Segmentation by MAP-ML Estimations
Abstract--Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probabilit...
Shifeng Chen, Liangliang Cao, Yueming Wang, Jianzh...