10054 search results - page 1942 / 2011 » On the Complexity of Function Learning |
106
click to vote
IFL
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
MHCI
2005
Springer
15 years 5 months ago
2005
Springer
Users of mobile tour guides often express a strong desire for the system to be able to provide information on arbitrary objects they encounter during their visit – akin to point...
OTM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We introduce XMLVM, a Turing complete XML-based programming language based on a stack-based, virtual machine. We show how XMLVM can automatically be created from Java cla...
STACS
2005
Springer
15 years 5 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
104
click to vote
TABLEAUX
2005
Springer
15 years 5 months ago
2005
Springer
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...