4007 search results - page 474 / 802 » Computation with imprecise probabilities |
193
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Iterative aggregation/disaggregation methods (IAD) belong to competitive tools for computation the characteristics of Markov chains as shown in some publications devoted to testing...
222
click to vote
DICTA
2008
15 years 8 months ago
2008
In this paper, we present a texture descriptor which hinges in the use of the local image statistics so as to recover a compact representation of the texture under study. To this ...
175
click to vote
ICISC
2008
15 years 8 months ago
2008
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
185
click to vote
AAAI
2006
15 years 8 months ago
2006
We present a new algorithm, called incremental least squares policy iteration (ILSPI), for finding the infinite-horizon stationary policy for partially observable Markov decision ...
169
click to vote
NIPS
2001
15 years 8 months ago
2001
Partial information can trigger a complete memory. At the same time, human memory is not perfect. A cue can contain enough information to specify an item in memory, but fail to tr...