1059 search results - page 57 / 212 » Improved Algorithms via Approximations of Probability Distri... |
152
Voted
TKDE
2002
15 years 3 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...
140
Voted
CC
2008
Springer
15 years 5 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...
192
Voted
ESANN
2000
15 years 5 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...
138
Voted
BMCBI
2010
15 years 3 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...
163
Voted
SIGECOM
2011
ACM
14 years 6 months 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...