2924 search results - page 315 / 585 » Lower Bounds in Distributed Computing |
174
click to vote
SOFSEM
2012
Springer
14 years 1 days ago
2012
Springer
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...
182
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
We consider the problem of shape recovery for real world scenes, where a variety of global illumination (interreflections, subsurface scattering, etc.) and illumination defocus e...
144
click to vote
AAAI
2012
13 years 6 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
155
click to vote
MOBISYS
2004
ACM
16 years 4 months ago
2004
ACM
Wireless data broadcast has received a lot of attention from industries and academia in recent years. Access efficiency and energy conservation are two critical performance concer...
135
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...