Sciweavers

1143 search results - page 214 / 229
» Mental models of recursion
Sort
View
ALT
2004
Springer
14 years 4 months ago
Learning Languages from Positive Data and Negative Counterexamples
In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the ...
Sanjay Jain, Efim B. Kinber
QEST
2008
IEEE
14 years 2 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
IROS
2007
IEEE
254views Robotics» more  IROS 2007»
14 years 1 months ago
3D datasets segmentation based on local attribute variation
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
Carla Silva Rocha Aguiar, Sébastien Druon, ...
SIGOPSE
1998
ACM
13 years 12 months ago
Nested Java processes: OS structure for mobile code
The majority of work on protection in single-language mobile code environments focuses on information security issues and depends on the language environment for solutions to the ...
Patrick Tullmann, Jay Lepreau
FPCA
1995
13 years 11 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong