13603 search results - page 91 / 2721 » On the Computational Complexity of Cut-Reduction |
190
click to vote
ENTCS
2006
15 years 6 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
149
click to vote
IANDC
2010
15 years 4 months ago
2010
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
182
click to vote
CSFW
2011
IEEE
14 years 5 months ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
153
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
186
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We describe a clustering approach with the emphasis on detecting coherent structures in a complex dataset, and illustrate its effectiveness with computer vision applicat...