10988 search results - page 2037 / 2198 » Algorithmic Folding Complexity |
123
Voted
APGV
2010
ACM
15 years 7 months ago
2010
ACM
The human visual system is able to quickly and robustly infer a wealth of scene information – the scene "gist" – already after 100 milliseconds of image presentation...
158
click to vote
COCO
2010
Springer
15 years 7 months ago
2010
Springer
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
136
Voted
COCO
2010
Springer
15 years 7 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
140
Voted
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Periodicity is a frequently happening phenomenon for moving objects. Finding periodic behaviors is essential to understanding object movements. However, periodic behaviors could b...
PODC
2010
ACM
15 years 7 months ago
2010
ACM
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...