1059 search results - page 57 / 212 » Improved Algorithms via Approximations of Probability Distri... |
101
click to vote
TKDE
2002
14 years 9 months ago
2002
In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions...
CC
2008
Springer
14 years 11 months ago
2008
Springer
Over the last seven years, we have developed static-analysis methods to recover a good approximation to the variables and dynamically allocated memory objects of a stripped executa...
139
click to vote
ESANN
2000
14 years 11 months ago
2000
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
BMCBI
2010
14 years 10 months ago
2010
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
104
click to vote
SIGECOM
2011
ACM
14 years 17 days ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...