Sciweavers

2343 search results - page 244 / 469
» Structure and Interpretation of Computer Programs
Sort
View
ALT
2003
Springer
16 years 3 months ago
Intrinsic Complexity of Uniform Learning
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
Sandra Zilles
DATE
2002
IEEE
137views Hardware» more  DATE 2002»
15 years 11 months ago
Practical Instruction Set Design and Compiler Retargetability Using Static Resource Models
The design of application (-domain) specific instructionset processors (ASIPs), optimized for code size, has traditionally been accompanied by the necessity to program assembly, ...
Qin Zhao, Bart Mesman, Twan Basten
ICDAR
2009
IEEE
15 years 4 months ago
Towards Handwritten Mathematical Expression Recognition
In this paper, we propose a new framework for online handwritten mathematical expression recognition. The proposed architecture aims at handling mathematical expression recognitio...
Ahmad-Montaser Awal, Harold Mouchère, Chris...
JLP
2010
85views more  JLP 2010»
15 years 1 months ago
Synchronous Kleene algebra
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
Cristian Prisacariu
POPL
2010
ACM
16 years 3 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts