Sciweavers

4903 search results - page 256 / 981
» The Set Covering Machine
Sort
View
ECML
2006
Springer
15 years 10 months ago
(Agnostic) PAC Learning Concepts in Higher-Order Logic
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
Kee Siong Ng
ICMLA
2009
15 years 4 months ago
Automatic Feature Selection for Model-Based Reinforcement Learning in Factored MDPs
Abstract--Feature selection is an important challenge in machine learning. Unfortunately, most methods for automating feature selection are designed for supervised learning tasks a...
Mark Kroon, Shimon Whiteson
OSDI
2004
ACM
16 years 7 months ago
MapReduce: Simplified Data Processing on Large Clusters
MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to ge...
Jeffrey Dean, Sanjay Ghemawat
EACL
2006
ACL Anthology
15 years 8 months ago
Automatic Acronym Recognition
This paper deals with the problem of recognizing and extracting acronymdefinition pairs in Swedish medical texts. This project applies a rule-based method to solve the acronym rec...
Dana Dannélls
SODA
2010
ACM
172views Algorithms» more  SODA 2010»
16 years 4 months ago
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
Aparna Das, Claire Mathieu