Sciweavers

2016 search results - page 245 / 404
» Distributed error confinement
Sort
View
ICML
2006
IEEE
16 years 6 months ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth
HPDC
2007
IEEE
15 years 11 months ago
A statistical approach to risk mitigation in computational markets
We study stochastic models to mitigate the risk of poor Quality-of-Service (QoS) in computational markets. Consumers who purchase services expect both price and performance guaran...
Thomas Sandholm, Kevin Lai
PODC
2006
ACM
15 years 11 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
15 years 9 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
GROUP
1993
ACM
15 years 9 months ago
ASCW: an assistant for cooperative work
The Assistant for Cooperative Work (ASCW) is a powerful system for the management of distributed work. It consists of the Task Manager, the organizational information system TOSCA...
Thomas Kreifelts, Wolfgang Prinz