824 search results - page 17 / 165 » Weighted Low-Rank Approximations |
COMGEO
2002
ACM
13 years 8 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
ICALP
2001
Springer
14 years 28 days ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
FSS
2007
13 years 8 months ago
2007
In Analytic Hierarchy Process (AHP) structured hierarchically as several criteria and alternatives, the priority of an alternative is obtained by using the pairwise comparisons ba...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
STACS
2010
Springer
13 years 6 months ago
2010
Springer
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...