1480 search results - page 141 / 296 » Distributed algorithms for weighted problems in sparse graph... |
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
89
Voted
FUIN
2006
15 years 19 days ago
2006
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
128
click to vote
STACS
2005
Springer
15 years 6 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
PKDD
2005
Springer
15 years 6 months ago
2005
Springer
Imbalanced data learning has recently begun to receive much attention from research and industrial communities as traditional machine learners no longer give satisfactory results. ...
113
Voted
ICDCS
2009
IEEE
15 years 9 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...