674 search results - page 73 / 135 » From Constructibility and Absoluteness to Computability and ... |
197
click to vote
TOG
2012
13 years 8 months ago
2012
We present a theoretical framework and practical method for the automatic construction of simple, all-quadrilateral patch layouts on manifold surfaces. The resulting layouts are c...
153
click to vote
KR
1989
Springer
15 years 10 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
201
click to vote
UIST
2004
ACM
15 years 11 months ago
2004
ACM
We present SketchREAD, a multi-domain sketch recognition engine capable of recognizing freely hand-drawn diagrammatic sketches. Current computer sketch recognition systems are dif...
168
click to vote
MCU
2004
15 years 7 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
155
click to vote
SMA
2005
ACM
15 years 12 months ago
2005
ACM
Given a planar set S of arbitrary topology and a radius r, we show how to construct an r-tightening of S, which is a set whose boundary has a radius of curvature everywhere greate...