3946 search results - page 301 / 790 » The computational complexity of choice sets |
180
click to vote
CIE
2010
Springer
15 years 11 months ago
2010
Springer
The Tile Assembly Model is a Turing universal model that Winfree introduced in order to study the nanoscale self-assembly of complex (typically aperiodic) DNA crystals. Winfree ex...
191
click to vote
CIE
2009
Springer
15 years 10 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
224
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. We present a categorical denotational semantics for a database mapping, based on views, in the most general framework of a database integration/exchange. Developed databa...
202
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Recognition of 3D objects from different viewpoints is a difficult problem. In this paper, we propose a new method to recognize 3D range images by matching local surface descripto...
160
click to vote
CHI
2002
ACM
16 years 7 months ago
2002
ACM
Tangible programming elements offer the dynamic and programmable properties of a computer without the complexity introduced by the keyboard, mouse and screen. This paper explores ...