12 citations · 33 across the 7 of their papers we have counts for
3 papers · 1 filter
Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?
Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu
Motivated by crowdsourced computation, peer-grading, and recommendation systems, Braverman, Mao and Weinberg [STOC'16] studied the \emph{query} and \emph{round} complexity of funda…
Hierarchical Clustering: Objective Functions and Algorithms
Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn +1
Hierarchical clustering is a recursive partitioning of a dataset into clusters at an increasingly finer granularity. Motivated by the fact that most work on hierarchical clustering…
Energy-efficient algorithms for non-preemptive speed-scaling
Vincent Cohen-Addad, Zhentao Li, Claire Mathieu +1
We improve complexity bounds for energy-efficient speed scheduling problems for both the single processor and multi-processor cases. Energy conservation has become a major concern,…