Sciweavers

438 search results - page 28 / 88
» The forest hiding problem
Sort
View
SODA
2001
ACM
125views Algorithms» more  SODA 2001»
15 years 1 months ago
Parallel processor scheduling with delay constraints
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
ICML
2008
IEEE
16 years 18 days ago
An empirical evaluation of supervised learning in high dimensions
In this paper we perform an empirical evaluation of supervised learning on highdimensional data. We evaluate performance on three metrics: accuracy, AUC, and squared loss and stud...
Rich Caruana, Nikolaos Karampatziakis, Ainur Yesse...
ESANN
2008
15 years 1 months ago
Classification of chestnuts with feature selection by noise resilient classifiers
In this paper we solve the problem of classifying chestnut plants according to their place of origin. We compare the results obtained by state of the art classifiers, among which,...
Elena Roglia, Rossella Cancelliere, Rosa Meo
MSV
2004
15 years 1 months ago
An Effective QBF Solver for Planning Problems
A large number of applications can be represented by quantified Boolean formulas (QBF). Although evaluating QBF is NP-hard and thus very difficult, there has been significant progr...
Charles Otwell, Anja Remshagen, Klaus Truemper
ESWS
2008
Springer
15 years 1 months ago
Combining Context Navigation with Semantic Autocompletion to Solve Problems in Concept Selection
Many tasks on the semantic web require the user to choose concepts from a limited vocabulary e.g. for describing an indexed resource or for use in semantic search. Semantic autocom...
Reetta Sinkkilä, Eetu Mäkelä, Eero ...