Sciweavers

2436 search results - page 376 / 488
» Comonadic Notions of Computation
Sort
View
TACS
1997
Springer
15 years 10 months ago
Optimal Representations of Polymorphic Types with Subtyping (Extended Abstract)
d Abstract) Alexander Aiken1 and Edward L. Wimmers2 and Jens Palsberg3 1 EECS Department, University of California at Berkeley, Berkeley, CA 94720-1776. 2 IBM Almaden Research Cent...
Alexander Aiken, Edward L. Wimmers, Jens Palsberg
ICRA
1994
IEEE
147views Robotics» more  ICRA 1994»
15 years 10 months ago
Provable Strategies for Vision-Guided Exploration in Three Dimensions
An approach is presented for exploring an unknown, arbitrary surface in three-dimensional (3D) space by a mobile robot. The main contributions are (1) an analysis of the capabilit...
Kiriakos N. Kutulakos, Charles R. Dyer, Vladimir J...
ECML
1993
Springer
15 years 10 months ago
Complexity Dimensions and Learnability
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
Shan-Hwei Nienhuys-Cheng, Mark Polman
ESORICS
1994
Springer
15 years 10 months ago
Oblivious Signatures
Abstract. An oblivious signature with n keys (or messages) is a signature that the recipient can choose one of n keys (or messages) to get signed while the signer cannot find out o...
Lidong Chen
COLT
1992
Springer
15 years 10 months ago
Language Learning from Stochastic Input
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
Shyam Kapur, Gianfranco Bilardi