3047 search results - page 371 / 610 » Randomized Parallel Selection |
128
click to vote
IPCO
2010
15 years 4 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
132
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
118
click to vote
ENTCS
2006
15 years 3 months ago
2006
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
142
click to vote
TIT
2010
14 years 9 months ago
2010
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
145
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...