911 search results - page 85 / 183 » The New Promise of Analog Computation |
STOC
1993
ACM
14 years 2 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...
CVIU
2011
13 years 1 months ago
2011
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
CHI
2010
ACM
14 years 5 months ago
2010
ACM
This CHI Note proposes a new research initiative for the HCI community: multi-lifespan information system design. The central idea begins with the identification of categories of ...
ACCV
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. This paper presents a fast algorithm for global motion estimation based on Iterative Least- Square Estimation (ILSE) technique. Compared with the traditional framework, t...