1480 search results - page 151 / 296 » Distributed algorithms for weighted problems in sparse graph... |
113
Voted
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
127
Voted
JACM
2011
14 years 3 months ago
2011
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
121
click to vote
SRDS
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
106
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
124
Voted
NIPS
2008
15 years 2 months ago
2008
Policy gradient (PG) reinforcement learning algorithms have strong (local) convergence guarantees, but their learning performance is typically limited by a large variance in the e...