7 citations · 8 across the 10 of their papers we have counts for
4 papers · 1 filter
Compact Representations of Geometric Bipartite Graphs via Weighted Biclique Covers
Aryan Esmailpour, Khoi Le, Stavros Sintos
Bipartite graphs are a fundamental representation for relational data arising in recommendation systems, social networks, and communication graphs. A key challenge in these setting…
On Fair Epsilon Net and Geometric Hitting Set
Mohsen Dehghankar, Stavros Sintos, Abolfazl Asudeh
Fairness has emerged as a formidable challenge in data-driven decisions. Many of the data problems, such as creating compact data summaries for approximate query processing, can be…
Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor
Nima Shahbazi, Stavros Sintos, Abolfazl Asudeh
Frequency estimation in streaming data often relies on sketches like Count-Min (CM) to provide approximate answers with sublinear space. However, CM sketches introduce additive err…
A Fair and Memory/Time-efficient Hashmap
Abolfazl Asudeh, Nima Shahbazi, Stavros Sintos
Hashmap is a fundamental data structure in computer science. There has been extensive research on constructing hashmaps that minimize the number of collisions leading to efficient…