268 search results - page 4 / 54 » Recursion Theoretic Operators for Function Complexity Classe... |
ITICSE
1997
ACM
15 years 1 months ago
1997
ACM
A programming exercise on recursion in which students create drawings of simple and bracketed Lindenmayer Systems provides a context for exploring additional computer science conc...
TMC
2008
14 years 9 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
TCS
2008
14 years 9 months ago
2008
Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold's (1967) model of learning in th...
ICDT
1999
ACM
15 years 1 months ago
1999
ACM
Abstract. In this paper we present a new approach for studying aggregations in the context of database query languages. Starting from a broad de nition of aggregate function, we ad...
COLT
2001
Springer
15 years 2 months ago
2001
Springer
A class C of recursive functions is called robustly learnable in the sense I (where I is any success criterion of learning) if not only C itself but even all transformed classes Î...