1480 search results - page 207 / 296 » Distributed algorithms for weighted problems in sparse graph... |
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
102
Voted
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We propose and analyze a new vantage point for the learning of mixtures of Gaussians: namely, the PAC-style model of learning probability distributions introduced by Kear...
116
Voted
ICPR
2010
IEEE
14 years 11 months ago
2010
IEEE
The expectation maximization (EM) algorithm is widely used in the Gaussian mixture model (GMM) as the state-of-art statistical modeling technique. Like the classical EM method, th...
CORR
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
119
click to vote
OPODIS
2010
14 years 11 months ago
2010
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...