1055 search results - page 93 / 211 » Enumerations in computable structure theory |
179
click to vote
FUIN
2010
15 years 3 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
153
click to vote
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
16 years 1 months ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
157
click to vote
INTERACT
2007
15 years 7 months ago
2007
With current disciplinary structures and academic priorities, Human– Computer Interaction faces ongoing challenges: is it a discipline in its own right, or simply a sub-disciplin...
141
click to vote
ENTCS
2008
15 years 6 months ago
2008
RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctl...
145
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We describe a new framework for globally solving the 3D-3D registration problem with unknown point correspondences. This problem is significant as it is frequently encountered in ...