800 search results - page 152 / 160 » On the Complexity of Parity Games |
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
A critical function in both machine vision and biological vision systems is attentional selection of scene regions worthy of further analysis by higher-level processes such as obj...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
SOSP
2005
ACM
14 years 5 months ago
2005
ACM
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
SI3D
2009
ACM
14 years 3 months ago
2009
ACM
Stylized rendering methods, which aim at depicting 3D scenes with 2D marks such as pigments or strokes, are often faced with temporal coherence issues when applied to dynamic scen...
BIBE
2008
IEEE
14 years 3 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...