515 search results - page 78 / 103 » Approximating Markov Processes by Averaging |
137
click to vote
CCGRID
2004
IEEE
15 years 5 months ago
2004
IEEE
In this paper we present a quantitative study of data survival in peer to peer storage systems. We first recall two main redundancy mechanisms: replication and erasure codes, whic...
144
click to vote
DAS
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Training and evaluation of techniques for handwriting recognition and retrieval is a challenge given that it is difficult to create large ground-truthed datasets. This is...
109
click to vote
NIPS
2007
15 years 3 months ago
2007
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
112
click to vote
TWC
2008
15 years 1 months ago
2008
We consider a multi-channel opportunistic communication system where the states of these channels evolve as independent and statistically identical Markov chains (the Gilbert-Elli...
136
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Eigenvectors of data matrices play an important role in many computational problems, ranging from signal processing to machine learning and control. For instance, algorithms that ...