Sciweavers

1059 search results - page 56 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
CONCUR
2001
Springer
15 years 2 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
BCB
2010
140views Bioinformatics» more  BCB 2010»
14 years 4 months ago
Guiding belief propagation using domain knowledge for protein-structure determination
A major bottleneck in high-throughput protein crystallography is producing protein-structure models from an electrondensity map. In previous work, we developed Acmi, a probabilist...
Ameet Soni, Craig A. Bingman, Jude W. Shavlik
TSP
2008
102views more  TSP 2008»
14 years 9 months ago
Spatially Adaptive Estimation via Fitted Local Likelihood Techniques
Abstract--This paper offers a new technique for spatially adaptive estimation. The local likelihood is exploited for nonparametric modeling of observations and estimated signals. T...
Vladimir Katkovnik, Vladimir Spokoiny
AI
2007
Springer
15 years 3 months ago
Improving Importance Sampling by Adaptive Split-Rejection Control in Bayesian Networks
Importance sampling-based algorithms are a popular alternative when Bayesian network models are too large or too complex for exact algorithms. However, importance sampling is sensi...
Changhe Yuan, Marek J. Druzdzel
FOCS
2000
IEEE
15 years 2 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk