84 citations · 100 across the 13 of their papers we have counts for
19 papers
Rounding the Ball LP for Fair Max-Min Diversification
Julián Mestre, Lam Khai Trinh, Anthony Wirth
Given points in a metric space, partitioned into groups, , and integer quotas, , summing to , the Fair Max-Min Diversification problem asks for…
Optimizing Function Layout for Mobile Applications
Ellis Hoag, Kyungwoo Lee, Julián Mestre +1
Function layout, also referred to as function reordering or function placement, is one of the most effective profile-guided compiler optimizations. By reordering functions in a bin…
Minimum Coverage Instrumentation
Li Chen, Ellis Hoag, Kyungwoo Lee +2
Modern compilers leverage block coverage profile data to carry out downstream profile-guided optimizations to improve the runtime performance and the size of a binary. Given a cont…
Nested Active-Time Scheduling
Nairen Cao, Jeremy T. Fineman, Shi Li +3
The active-time scheduling problem considers the problem of scheduling preemptible jobs with windows (release times and deadlines) on a parallel machine that can schedule up to …
On the Extended TSP Problem
Julián Mestre, Sergey Pupyrev, Seeun William Umboh
We initiate the theoretical study of Ext-TSP, a problem that originates in the area of profile-guided binary optimization. Given a graph with positive edge weights $w: E…
QUEST: Queue Simulation for Content Moderation at Scale
Rahul Makhijani, Parikshit Shah, Vashist Avadhanula +3
Moderating content in social media platforms is a formidable challenge due to the unprecedented scale of such systems, which typically handle billions of posts per day. Some of the…