Sciweavers

824 search results - page 38 / 165
» Weighted Low-Rank Approximations
Sort
View
CORR
2008
Springer
169views Education» more  CORR 2008»
13 years 8 months ago
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
Mingyu Xiao, Leizhen Cai, Andrew C. Yao
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 8 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
JAT
2006
66views more  JAT 2006»
13 years 8 months ago
An extrapolation theorem for nonlinear approximation and its applications
We prove an extrapolation theorem for the nonlinear m-term approximation with respect to a system of functions satisfying very mild conditions. This theorem allows us to prove end...
Feng Dai
ISITA
2010
13 years 6 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
CISS
2008
IEEE
13 years 10 months ago
Portfolio diversification using subspace factorizations
Abstract-- Successful investment management relies on allocating assets so as to beat the stock market. Asset classes are affected by different market dynamics or latent trends. Th...
Ruairi de Frein, Konstantinos Drakakis, Scott Rick...