1480 search results - page 18 / 296 » Distributed algorithms for weighted problems in sparse graph... |
IPPS
2003
IEEE
14 years 23 days ago
2003
IEEE
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper a novel approach for semi-supervised hyperspectral unmixing is presented. First, it is shown that this problem inherently accepts a sparse solution. Then, based on t...
AAIM
2007
Springer
14 years 1 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
STACS
2004
Springer
14 years 25 days ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...