We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
William J. Knottenbelt, Mark Mestern, Peter G. Har...
We consider the problem of estimating the time-average variance constant for a stationary process. A previous paper described an approach based on multiple integrations of the sim...
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
This paper describes an online handwritten Japanese character string recognition system based on conditional random fields, which integrates the information of character recogniti...
A simple analytical model is proposed here that captures to a large extent the kinematic structure of rat exploratory behavior. Previous studies have shown that such behavior consi...