Sciweavers

1802 search results - page 288 / 361
» Model-based Theory Combination
Sort
View
ML
2008
ACM
13 years 9 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
ML
2006
ACM
13 years 9 months ago
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
NGC
2006
Springer
135views Communications» more  NGC 2006»
13 years 9 months ago
Seeing Things: Inventive Reasoning with Geometric Analogies and Topographic Maps
This paper examines two seemingly unrelated qualitative spatial reasoning domains; geometric proportional analogies and topographic (landcover) maps. We present a Structure Matchin...
Diarmuid P. O'Donoghue, Amy J. Bohan, Mark T. Kean...
PC
2006
103views Management» more  PC 2006»
13 years 9 months ago
Parallel skeletons for manipulating general trees
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficien...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
AI
2005
Springer
13 years 9 months ago
Semiotic schemas: A framework for grounding language in action and perception
A theoretical framework for grounding language is introduced that provides a computational path from sensing and motor action to words and speech acts. The approach combines conce...
Deb Roy