993 search results - page 73 / 199 » The Complexity of Probabilistic EL |
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
CC
2007
Springer
13 years 7 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—This paper considers the design of efficient strategies that allow cognitive users to choose frequency bands to sense and access among multiple bands with unknown parameters. F...
Publication
Modern urban regions are highly complex entities. Despite the difficulty of modeling every relevant aspect of an urban region, researchers have produced a rich variety of models de...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
We propose in this paper an interactive segmentation algorithm based on curve evolution techniques. The task of automated segmentation has proven to be highly complex and applicat...