Sciweavers

506 search results - page 71 / 102
» Contracts as Pairs of Projections
Sort
View
ICML
2006
IEEE
14 years 8 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
SPAA
2009
ACM
14 years 8 months ago
Buffer management for colored packets with deadlines
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Mosci...
KDD
2001
ACM
163views Data Mining» more  KDD 2001»
14 years 8 months ago
The "DGX" distribution for mining massive, skewed data
Skewed distributions appear very often in practice. Unfortunately, the traditional Zipf distribution often fails to model them well. In this paper, we propose a new probability di...
Zhiqiang Bi, Christos Faloutsos, Flip Korn
SAC
2009
ACM
14 years 2 months ago
Remote software protection by orthogonal client replacement
In a typical client-server scenario, a trusted server provides valuable services to a client, which runs remotely on an untrusted platform. Of the many security vulnerabilities th...
Mariano Ceccato, Paolo Tonella, Mila Dalla Preda, ...
HASE
2007
IEEE
14 years 1 months ago
Scalable, Adaptive, Time-Bounded Node Failure Detection
This paper presents a scalable, adaptive and timebounded general approach to assure reliable, real-time Node-Failure Detection (NFD) for large-scale, high load networks comprised ...
Matthew Gillen, Kurt Rohloff, Prakash Manghwani, R...