23 citations · 41 across the 14 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2020★ 2 cited
Nearly Linear Row Sampling Algorithm for Quantile Regression
Yi Li, Ruosong Wang, Lin Yang +1
We give a row sampling algorithm for the quantile loss function with sample complexity nearly linear in the dimensionality of the data, improving upon the previous best algorithm w…
cs.DS2018★ 3 cited
Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity
Wei Chen, Shang-Hua Teng, Hanrui Zhang
We introduce two new "degree of complementarity" measures, which we refer to, respectively, as supermodular width and superadditive width. Both are formulated based on natural witn…
cs.DS2016★ 3 cited
An Improved Algorithm for Incremental DFS Tree in Undirected Graphs
Lijie Chen, Ran Duan, Ruosong Wang +2
Depth first search (DFS) tree is one of the most well-known data structures for designing efficient graph algorithms. Given an undirected graph with vertices and …