6907 search results - page 1250 / 1382 » Securing distributed adaptation |
132
click to vote
NIPS
2004
15 years 4 months ago
2004
Most existing tracking algorithms construct a representation of a target object prior to the tracking task starts, and utilize invariant features to handle appearance variation of...
116
Voted
NIPS
2004
15 years 4 months ago
2004
We propose a novel a framework for deriving approximations for intractable probabilistic models. This framework is based on a free energy (negative log marginal likelihood) and ca...
120
Voted
OPODIS
2004
15 years 4 months ago
2004
Abstract. We consider the issue of task assignment in a distributed system under heavy-tailed (ie. highly variable) workloads. A new adaptable approach called TAPTF (Task Assignmen...
154
click to vote
PDPTA
2003
15 years 4 months ago
2003
The evolution of distributed applications to reflect structural changes or to adapt to specific conditions of the run-time environment is a difficult issue especially if continuou...
134
Voted
SDM
2003
SIAM
15 years 4 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...