Sciweavers

10054 search results - page 1942 / 2011
» On the Complexity of Function Learning
Sort
View
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
15 years 11 months ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
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...
Edwin Brady, Kevin Hammond
MHCI
2005
Springer
15 years 11 months ago
Understanding the role of image recognition in mobile tour guides
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...
Nigel Davies, Keith Cheverst, Alan J. Dix, Andre H...
OTM
2005
Springer
15 years 11 months ago
An XML-Based Cross-Language Framework
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...
Arno Puder
STACS
2005
Springer
15 years 11 months ago
Kolmogorov-Loveland Randomness and Stochasticity
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...
Wolfgang Merkle, Joseph S. Miller, André Ni...
TABLEAUX
2005
Springer
15 years 11 months ago
A Tableau-Based Explainer for DL Subsumption
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...
Thorsten Liebig, Michael Halfmann
« Prev « First page 1942 / 2011 Last » Next »