
Maximizing coverage while ensuring fairness: a tale of conflicting objective
Ensuring fairness in computational problems has emerged as a key topic d...
read it

Learning Lines with Ordinal Constraints
We study the problem of finding a mapping f from a set of points into th...
read it

Computing BiLipschitz Outlier Embeddings into the Line
The problem of computing a biLipschitz embedding of a graphical metric ...
read it

A Polynomial Time Algorithm for LogConcave Maximum Likelihood via Locally Exponential Families
We consider the problem of computing the maximum likelihood multivariate...
read it

Learning Mahalanobis Metric Spaces via Geometric Approximation Algorithms
Learning Mahalanobis metric spaces is an important problem that has foun...
read it

A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Logconcave Densities
We study the problem of computing the maximum likelihood estimator (MLE)...
read it

Chasing Similarity: Distributionaware Aggregation Scheduling (Extended Version)
Parallel aggregation is a ubiquitous operation in data analytics that is...
read it

Algorithms for metric learning via contrastive embeddings
We study the problem of supervised learning a metric space under discrim...
read it

Alleviating partisan gerrymandering: can math and computers help to eliminate wasted votes?
Partisan gerrymandering is a major cause for voter disenfranchisement in...
read it

NearOptimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Logconcave Densities
We study the problem of learning multivariate logconcave densities with...
read it

Sketching and Clustering Metric Measure Spaces
Two important optimization problems in the analysis of geometric data se...
read it

Algorithms for lowdistortion embeddings into arbitrary 1dimensional spaces
We study the problem of finding a minimumdistortion embedding of the sh...
read it

Fractal dimension and lower bounds for geometric problems
We study the complexity of geometric problems on spaces of low fractal d...
read it

Routing Symmetric Demands in Directed MinorFree Graphs with Constant Congestion
The problem of routing in graphs using nodedisjoint paths has received ...
read it

On constant multicommodity flowcut gaps for directed minorfree graphs
The multicommodity flowcut gap is a fundamental parameter that affects...
read it

Temporal Hierarchical Clustering
We study hierarchical clusterings of metric spaces that change over time...
read it
Anastasios Sidiropoulos
is this you? claim profile