244 search results - page 31 / 49 » On-Line Probability, Complexity and Randomness |
116
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
123
click to vote
MFCS
2010
Springer
15 years 9 days ago
2010
Springer
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
179
Voted
PODC
2011
ACM
14 years 4 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
115
click to vote
CVPR
2008
IEEE
15 years 8 months ago
2008
IEEE
The spatial distribution of fingerprint minutiae is a core problem in the fingerprint individuality study, the cornerstone of the fingerprint authentication technology. Previously...
125
click to vote
COMPGEOM
2008
ACM
15 years 3 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...