Sciweavers

1454 search results - page 16 / 291
» Learning with cost intervals
Sort
View
PPOPP
2005
ACM
14 years 29 days ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
ICALP
2003
Springer
14 years 18 days ago
Real-Time Scheduling with a Budget
We are given a set of jobs each has a processing time, a non-negative weight, a set of possible time intervals in which it can be processed and a cost. The goal is to schedule a f...
Joseph Naor, Hadas Shachnai, Tami Tamir
AAIM
2009
Springer
98views Algorithms» more  AAIM 2009»
14 years 2 months ago
Latency Constrained Aggregation in Chain Networks Admits a PTAS
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
Tim Nonner, Alexander Souza
ICML
2002
IEEE
14 years 8 months ago
Pruning Improves Heuristic Search for Cost-Sensitive Learning
This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to ...
Valentina Bayer Zubek, Thomas G. Dietterich
SDM
2009
SIAM
117views Data Mining» more  SDM 2009»
14 years 4 months ago
Spatially Cost-Sensitive Active Learning.
In active learning, one attempts to maximize classifier performance for a given number of labeled training points by allowing the active learning algorithm to choose which points...
Alexander Liu, Goo Jun, Joydeep Ghosh