Sciweavers

1763 search results - page 138 / 353
» A Formalization of Polytime Functions
Sort
View
ICDAR
2011
IEEE
13 years 9 months ago
A Method of Evaluating Table Segmentation Results Based on a Table Image Ground Truther
—We propose a novel method to evaluate table segmentation results based on a table image ground truther. In the ground-truthing process, we first extract connected components fr...
Yanhui Liang, Yizhou Wang, Eric Saund
AAMAS
2012
Springer
13 years 5 months ago
Koko: an architecture for affect-aware games
The importance of affect in delivering engaging experiences in entertainment and educational games is well recognized. Yet, current techniques for building affect-aware games are l...
Derek J. Sollenberger, Munindar P. Singh
PPDP
2007
Springer
15 years 4 months ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
IFL
2004
Springer
138views Formal Methods» more  IFL 2004»
15 years 3 months ago
A Rational Deconstruction of Landin's SECD Machine
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
Olivier Danvy
IFL
2003
Springer
144views Formal Methods» more  IFL 2003»
15 years 3 months ago
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The...
Rafael Martínez, Ricardo Pena