Sciweavers

687 search results - page 37 / 138
» Feature (De)composition in Functional Programming
Sort
View
AIPS
2004
13 years 10 months ago
Heuristic Refinements of Approximate Linear Programming for Factored Continuous-State Markov Decision Processes
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
Branislav Kveton, Milos Hauskrecht
JMLR
2012
11 years 11 months ago
Domain Adaptation: A Small Sample Statistical Approach
We study the prevalent problem when a test distribution differs from the training distribution. We consider a setting where our training set consists of a small number of sample d...
Ruslan Salakhutdinov, Sham M. Kakade, Dean P. Fost...
ECML
2007
Springer
14 years 3 months ago
Conceptual Clustering Applied to Ontologies
Abstract. A clustering method is presented which can be applied to semantically annotated resources in the context of ontological knowledge bases. This method can be used to discov...
Floriana Esposito, Nicola Fanizzi, Claudia d'Amato
ICFP
2006
ACM
14 years 8 months ago
Context-parametric polykinded types
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
Pablo Nogueira
JCSS
2002
114views more  JCSS 2002»
13 years 8 months ago
Polymorphic Type Inference for the Relational Algebra
A database programming language is a programming language extended with database operations. In this paper we extend a core functional language with explicitly labeled tuples and ...
Jan Van den Bussche, Emmanuel Waller