14699 search results - page 290 / 2940 » Complexity and Cognitive Computing |
141
click to vote
STOC
1993
ACM
15 years 8 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...
154
click to vote
ICFP
2007
ACM
16 years 4 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
108
click to vote
ICIP
2004
IEEE
16 years 5 months ago
2004
IEEE
DCT-based CODECs such as MPEG-4 Visual and H.263 "skip" many macroblocks during encoding of typical video sequences (i.e. no coded data is transmitted for these macroblo...
133
Voted
GD
2007
Springer
15 years 10 months ago
2007
Springer
The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the o...
113
click to vote
TGC
2007
Springer
15 years 10 months ago
2007
Springer
We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done...