Sciweavers

8647 search results - page 76 / 1730
» The Container Selection Problem
Sort
View
113
Voted
ICML
2003
IEEE
16 years 3 months ago
Online Feature Selection using Grafting
In the standard feature selection problem, we are given a fixed set of candidate features for use in a learning problem, and must select a subset that will be used to train a mode...
Simon Perkins, James Theiler
125
Voted
PODS
2010
ACM
205views Database» more  PODS 2010»
15 years 7 months ago
Positive higher-order queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
Michael Benedikt, Gabriele Puppis, Huy Vu
89
Voted
CHI
2002
ACM
16 years 3 months ago
Email archive overviews using subject indexes
Archived discussion lists are becoming significant reference sources. This paper describes a new type of overview for such lists, using a back-of-the-book style index containing h...
Paula S. Newman
MLDM
2005
Springer
15 years 8 months ago
Supervised Evaluation of Dataset Partitions: Advantages and Practice
In the context of large databases, data preparation takes a greater importance : instances and explanatory attributes have to be carefully selected. In supervised learning, instanc...
Sylvain Ferrandiz, Marc Boullé
120
Voted
FOCS
1999
IEEE
15 years 7 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl