Sciweavers

1806 search results - page 154 / 362
» Randomness and halting probabilities
Sort
View
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
13 years 9 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 5 months ago
Matched Filtering from Limited Frequency Samples
In this paper, we study a simple correlation-based strategy for estimating the unknown delay and amplitude of a signal based on a small number of noisy, randomly chosen frequency-...
Armin Eftekhari, Justin K. Romberg, Michael B. Wak...
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
14 years 4 months ago
Multi-objective Model Checking of Markov Decision Processes
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Va...
WSC
2000
13 years 11 months ago
Input modeling using a computer algebra system
Input modeling that involves fitting standard univariate parametric probability distributions is typically performed using an input modeling package. These packages typically fit ...
Diane L. Evans, Lawrence Leemis
ICIP
2001
IEEE
14 years 11 months ago
EM algorithms of Gaussian mixture model and hidden Markov model
The HMM (Hidden Markov Model) is a probabilistic model of the joint probability of a collection of random variables with both observations and states. The GMM (Gaussian Mixture Mo...
Guorong Xuan, Wei Zhang, Peiqi Chai