Sciweavers

213 search results - page 31 / 43
» The randomized complexity of initial value problems
Sort
View
UAI
1998
13 years 9 months ago
Structured Reachability Analysis for Markov Decision Processes
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
Craig Boutilier, Ronen I. Brafman, Christopher W. ...
RECOMB
2002
Springer
14 years 8 months ago
Revealing protein structures: a new method for mapping antibody epitopes
A recent idea for determining the three-dimensional structure of a protein uses antibody recognition of surface structure and random peptide libraries to map antibody epitope comb...
Brendan Mumey, Brian W. Bailey, Edward A. Dratz
AVSS
2006
IEEE
14 years 1 months ago
Nonparametric Background Modeling Using the CONDENSATION Algorithm
Background modeling for dynamic scenes is an important problem in the context of real time video surveillance systems. Several nonparametric background models have been proposed t...
Xingzhi Luo, Suchendra M. Bhandarkar, Wei Hua, Hai...
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 2 months ago
Managing Network Congestion with a Kohonen-Based RED Queue
— The behaviour of the TCP AIMD algorithm is known to cause queue length oscillations when congestion occurs at a router output link. Indeed, due to these queueing variations, en...
Emmanuel Lochin, Bruno Talavera
CISS
2008
IEEE
14 years 2 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman