3088 search results - page 82 / 618 » Online Passive-Aggressive Algorithms |
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
HICSS
1994
IEEE
15 years 1 months ago
1994
IEEE
We present a new distributed algorithm that detects and resolves communication deadlocks on-line, i.e., simultaneously detects and resolves deadlock as communication requests are ...
ASPDAC
2005
ACM
14 years 11 months ago
2005
ACM
Abstract— Today’s embedded systems are typically distributed and more often confronted with timevarying demands. Existing methodologies that optimize the partitioning of comput...
COLOGNETWENTE
2008
14 years 11 months ago
2008
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We introduce a new online convex optimization algorithm that adaptively chooses its regularization function based on the loss functions observed so far. This is in contrast to pre...