54 search results - page 6 / 11 » Learning Non-Isomorphic Tree Mappings for Machine Translatio... |
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
APPT
2009
Springer
15 years 4 months ago
2009
Springer
MapReduce has been prevalent for running data-parallel applications. By hiding other non-functionality parts such as parallelism, fault tolerance and load balance from programmers,...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
Computer experiments often require dense sweeps over input parameters to obtain a qualitative understanding of their response. Such sweeps can be prohibitively expensive, and are ...