output
19982026
most citedClustering and Community Detection in Directed Networks: A Survey

599 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2016Show all

12 papers · 1 filter

stat.ML2016★ 27 cited

The Generalized Reparameterization Gradient

Francisco J. R. Ruiz, Michalis K. Titsias, David M. Blei

The reparameterization gradient has become a widely used method to obtain Monte Carlo gradients to optimize the variational objective. However, this technique does not easily apply…

cs.GT2016★ 2 cited

Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design

Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis

We study a type of reverse (procurement) auction problems in the presence of budget constraints. The general algorithmic problem is to purchase a set of resources, which come at a…

cs.DS2016

K-clique-graphs for Dense Subgraph Discovery

G. Nikolentzos, P. Meladianos, Y. Stavrakas +1

Finding dense subgraphs in a graph is a fundamental graph mining task, with applications in several fields. Algorithms for identifying dense subgraphs are used in biology, in finan…

stat.ME2016★ 1 cited

Variations of Power-Expected-Posterior Priors in Normal Regression Models

Dimitris Fouskakis, Ioannis Ntzoufras, Konstantinos Perrakis

The power-expected-posterior (PEP) prior is an objective prior for Gaussian linear models, which leads to consistent model selection inference, under the M-closed scenario, and ten…

cs.GT2016★ 39 cited

On Truthful Mechanisms for Maximin Share Allocations

Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis

We study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of players, the maximin share of a single player is th…

cs.DS2016

On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem

Pavlos Eirinakis, Matthew Williamson, K. Subramani

The Shoshan-Zwick algorithm solves the all pairs shortest paths problem in undirected graphs with integer edge costs in the range . It runs in $\tilde{O}(M\cdot…

stat.ML2016★ 14 cited

Overdispersed Black-Box Variational Inference

Francisco J. R. Ruiz, Michalis K. Titsias, David M. Blei

We introduce overdispersed black-box variational inference, a method to reduce the variance of the Monte Carlo estimator of the gradient in black-box variational inference. Instead…

cs.DS2016

Scheduling MapReduce Jobs under Multi-Round Precedences

Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos +2

We consider non-preemptive scheduling of MapReduce jobs with multiple tasks in the practical scenario where each job requires several map-reduce rounds. We seek to minimize the ave…

cs.NI2016

Object-oriented Packet Caching for ICN

Yannis Thomas, George Xylomenos, Christos Tsilopoulos +1

One of the most discussed features offered by Information-centric Networking (ICN) architectures is the ability to support packet-level caching at every node in the network. By ind…

math.PR2016

Polynomial approximations to continuous functions and stochastic compositions

Takis Konstantopoulos, Linglong Yuan, Michael A. Zazanis

This paper presents a stochastic approach to theorems concerning the behavior of iterations of the Bernstein operator taking a continuous function to a degree-…

math.PR2016★ 5 cited

Thinning and Information Projections

Peter Harremoës, Oliver Johnson, Ioannis Kontoyiannis

In this paper we establish lower bounds on information divergence of a distribution on the integers from a Poisson distribution. These lower bounds are tight and in the cases where…

cs.NI2016★ 66 cited

Streaming Big Data meets Backpressure in Distributed Network Computation

Apostolos Destounis, Georgios S. Paschos, Iordanis Koutsopoulos

We study network response to queries that require computation of remotely located data and seek to characterize the performance limits in terms of maximum sustainable query rate th…