Sciweavers

2036 search results - page 226 / 408
» From Sampling to Model Counting
Sort
View
163
Voted
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
16 years 3 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
ICDT
2010
ACM
219views Database» more  ICDT 2010»
16 years 3 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
PAMI
2007
245views more  PAMI 2007»
15 years 5 months ago
Tracking People by Learning Their Appearance
—An open vision problem is to automatically track the articulations of people from a video sequence. This problem is difficult because one needs to determine both the number of p...
Deva Ramanan, David A. Forsyth, Andrew Zisserman
WCE
2007
15 years 7 months ago
Scenario Generation Employing Copulas
—Multistage stochastic programs are effective for solving long-term planning problems under uncertainty. Such programs are usually based on scenario generation model about future...
Kristina Sutiene, Henrikas Pranevicius
154
Voted
IOR
2008
126views more  IOR 2008»
15 years 6 months ago
Fast Simulation of Multifactor Portfolio Credit Risk
This paper develops rare event simulation methods for the estimation of portfolio credit risk -- the risk of losses to a portfolio resulting from defaults of assets in the portfol...
Paul Glasserman, Wanmo Kang, Perwez Shahabuddin