53 search results - page 11 / 11 » Computationally Sound Mechanized Proofs of Correspondence As... |
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
PLDI
1997
ACM
13 years 9 months ago
1997
ACM
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
STOC
1993
ACM
13 years 9 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...