ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1703.02690
  4. Cited By
Leveraging Sparsity for Efficient Submodular Data Summarization

Leveraging Sparsity for Efficient Submodular Data Summarization

8 March 2017
Erik M. Lindgren
Shanshan Wu
A. Dimakis
ArXivPDFHTML

Papers citing "Leveraging Sparsity for Efficient Submodular Data Summarization"

4 / 4 papers shown
Title
Fair Submodular Cover
Fair Submodular Cover
Wenjing Chen
Shuo Xing
Samson Zhou
Victoria G. Crawford
35
2
0
05 Jul 2024
Fair and Representative Subset Selection from Data Streams
Fair and Representative Subset Selection from Data Streams
Yanhao Wang
Francesco Fabbri
M. Mathioudakis
16
0
0
09 Oct 2020
"Bring Your Own Greedy"+Max: Near-Optimal $1/2$-Approximations for
  Submodular Knapsack
"Bring Your Own Greedy"+Max: Near-Optimal 1/21/21/2-Approximations for Submodular Knapsack
Dmitrii Avdiukhin
G. Yaroslavtsev
Samson Zhou
16
35
0
12 Oct 2019
Efficient Representative Subset Selection over Sliding Windows
Efficient Representative Subset Selection over Sliding Windows
Yanhao Wang
Yuchen Li
K. Tan
19
13
0
15 Jun 2017
1