1074 search results - page 94 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
PPOPP
1999
ACM
15 years 2 months ago
1999
ACM
Writing parallel applications for computational grids is a challenging task. To achieve good performance, algorithms designed for local area networks must be adapted to the differ...
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
Abstract. We propose a prediction-based best-effort real-time service to support distributed, interactive applications in shared, unreserved computing environments. These applicati...
NIPS
2003
14 years 11 months ago
2003
In the problem of probability forecasting the learner’s goal is to output, given a training set and a new object, a suitable probability measure on the possible values of the ne...
106
click to vote
JMLR
2012
13 years 8 days ago
2012
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...