6 citations · 32 across the 37 of their papers we have counts for
5 papers · 1 filter
Perfect Sampling from Pairwise Comparisons
Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos
In this work, we study how to efficiently obtain perfect samples from a discrete distribution given access only to pairwise comparisons of elements of its support. Sp…
Graph Connectivity with Noisy Queries
Dimitris Fotakis, Evangelia Gergatsouli, Charilaos Pipis +2
Graph connectivity is a fundamental combinatorial optimization problem that arises in many practical applications, where usually a spanning subgraph of a network is used for its op…
Sampling and Optimal Preference Elicitation in Simple Mechanisms
Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
In this work we are concerned with the design of efficient mechanisms while eliciting limited information from the agents. First, we study the performance of sampling approximation…
Detecting and analysing the topology of the cosmic web with spatial clustering algorithms I: Methods
Dimitrios Kelesis, Spyros Basilakos, Vicky Papadopoulou Lesta +2
In this paper we explore the use of spatial clustering algorithms as a new computational approach for modeling the cosmic web. We demonstrate that such algorithms are efficient in…
Differentially Private Regression with Unbounded Covariates
Jason Milionis, Alkis Kalavasis, Dimitris Fotakis +1
We provide computationally efficient, differentially private algorithms for the classical regression settings of Least Squares Fitting, Binary Regression and Linear Regression with…