2 citations · 11 across the 16 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2020★ 2 cited
Graph Sparsification by Universal Greedy Algorithms
Ming-Jun Lai, Jiaxin Xie, Zhiqiang Xu
Graph sparsification is to approximate an arbitrary graph by a sparse graph and is useful in many applications, such as simplification of social networks, least squares problems, n…
cs.DS2020
A symmetric alternating minimization algorithm for total variation minimization
Yuan Lei, Jiaxin Xie
In this paper, we propose a novel symmetric alternating minimization algorithm to solve a broad class of total variation (TV) regularization problems. Unlike the usual …
cs.DS2019★ 2 cited
Subset Selection for Matrices with Fixed Blocks
Jiaxin Xie, Zhiqiang Xu
Subset selection for matrices is the task of extracting a column sub-matrix from a given matrix with such that the pseudoinverse of the sampled m…