654 search results - page 49 / 131 » Ordered Sets and Complete Lattices |
MCU
1998
13 years 9 months ago
1998
A BSS machine is -uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turi...
ASIACRYPT
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
IJRR
2008
13 years 7 months ago
2008
Robots must complete their tasks in spite of unreliable actuators and limited, noisy sensing. In this paper, we consider the information requirements of such tasks. What sensing a...
JMIV
2007
13 years 7 months ago
2007
Illusorycontours,suchastheclassicalKanizsatriangleandsquare[9],areintrinsicphenomenainhuman vision. These contours are not completely defined by real object boundaries, but also i...
FOSSACS
2004
Springer
13 years 11 months ago
2004
Springer
In this paper we present a theorem for defining fixed-points in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science ...