433 search results - page 58 / 87 » Optimal Segmentation of Random Sequences |
100
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
116
click to vote
UAI
2003
15 years 1 months ago
2003
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
AAAI
2008
15 years 2 months ago
2008
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
112
click to vote
CASES
2007
ACM
15 years 3 months ago
2007
ACM
We derive analytically, the performance optimal throttling curve for a processor under thermal constraints for a given task sequence. We found that keeping the chip temperature co...