846 search results - page 38 / 170 » Dependent rounding and its applications to approximation alg... |
130
click to vote
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...
116
click to vote
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
To support incremental replay of message-passing applications, processes must periodically checkpoint and the content of some messages must be logged, to break dependencies of the...
133
click to vote
ISVC
2007
Springer
15 years 7 months ago
2007
Springer
We present a novel boosting algorithm where temporal consistency is addressed in a short-term way. Although temporal correlation of observed data may be an important cue for classi...
117
click to vote
NIPS
2008
15 years 2 months ago
2008
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
114
click to vote
RECOMB
2004
Springer
16 years 1 months ago
2004
Springer
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...