824 search results - page 15 / 165 » Weighted Low-Rank Approximations |
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
ESA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
PPAM
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
ICTCS
2005
Springer
14 years 1 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
LWA
2008
13 years 10 months ago
2008
Weighted voting is the commonly used strategy for combining predictions in pairwise classification. Even though it shows excellent performance in practice, it is often criticized ...