6039 search results - page 263 / 1208 » The Function Space of an Activity |
191
click to vote
FLAIRS
2004
15 years 8 months ago
2004
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...
193
click to vote
ADCM
2008
15 years 7 months ago
2008
Abstract. Signals with finite rate of innovation are those signals having finite degrees of freedom per unit of time that specify them. In this paper, we introduce a prototypical s...
215
click to vote
SBBD
2004
15 years 8 months ago
2004
In order to index text fields in XML databases for similarity queries, M-Trees may be applied. However, some datasets experiments using M-Trees for this purpose resulted in low qu...
170
click to vote
EUROCRYPT
2004
Springer
16 years 19 days ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
202
click to vote
AAAI
2012
13 years 9 months ago
2012
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...