Sciweavers

14699 search results - page 378 / 2940
» Complexity and Cognitive Computing
Sort
View
MFCS
2009
Springer
15 years 11 months ago
Parameterized Complexity Classes under Logical Reductions
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
Anuj Dawar, Yuguo He
SAGT
2009
Springer
112views Game Theory» more  SAGT 2009»
15 years 11 months ago
On the Complexity of Iterated Weak Dominance in Constant-Sum Games
Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...
Felix Brandt, Markus Brill, Felix A. Fischer, Paul...
FOCS
2007
IEEE
15 years 11 months ago
Round Complexity of Authenticated Broadcast with a Dishonest Majority
Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI an...
Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafai...
ICC
2007
IEEE
15 years 11 months ago
A Statistical Bit Error Generator for Emulation of Complex Forward Error Correction Schemes
— Forward Error Correction (FEC) schemes are generally used in wireless communication systems to maintain an acceptable quality of service. Various models have been proposed in l...
Reuben A. Farrugia, Carl James Debono
WAPCV
2007
Springer
15 years 11 months ago
An Experimental Comparison of Three Guiding Principles for the Detection of Salient Image Locations: Stability, Complexity, and
We present an experimental comparison of the performance of representative saliency detectors from three guiding principles for the detection of salient image locations: locations...
Dashan Gao, Nuno Vasconcelos