Sciweavers

995 search results - page 57 / 199
» Learning Useful Horn Approximations
Sort
View
EMNLP
2006
13 years 11 months ago
Loss Minimization in Parse Reranking
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
Ivan Titov, James Henderson
DLOG
2007
14 years 7 days ago
Speeding up Approximation with Nicer Concepts
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
Anni-Yasmin Turhan, Yusri Bong
ACE
2004
161views Education» more  ACE 2004»
13 years 11 months ago
Flexible Learning - Maximising Flexibility in a Subject with Large Student Numbers
In providing the introductory computing subject (topic) Information Technology 1A to approximately 800 students per annum in three different modes, a number of delivery mechanisms...
Robert Goodwin, Neville Williams
PODS
1999
ACM
151views Database» more  PODS 1999»
14 years 2 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin
ICRA
2008
IEEE
169views Robotics» more  ICRA 2008»
14 years 4 months ago
Sparse incremental learning for interactive robot control policy estimation
— We are interested in transferring control policies for arbitrary tasks from a human to a robot. Using interactive demonstration via teloperation as our transfer scenario, we ca...
Daniel H. Grollman, Odest Chadwicke Jenkins