scispace - formally typeset
G

George Arvanitakis

Researcher at Aristotle University of Thessaloniki

Publications -  21
Citations -  267

George Arvanitakis is an academic researcher from Aristotle University of Thessaloniki. The author has contributed to research in topics: Base station & Heterogeneous network. The author has an hindex of 6, co-authored 19 publications receiving 194 citations. Previous affiliations of George Arvanitakis include Huawei & Max Planck Society.

Papers
More filters

Potential for discrimination in online targeted advertising

TL;DR: It is shown that a malicious advertiser can create highly discriminatory ads without using sensitive attributes and that the problem of discrimination in targeted advertising is much more pernicious.
Proceedings ArticleDOI

Broadband wireless channel measurements for high speed trains

TL;DR: A channel sounding measurement campaign for cellular broadband wireless communications with high speed trains that was carried out in the context of the project CORRIDOR, which combines MIMO and carrier aggregation to achieve very high throughputs is described.
Journal ArticleDOI

Review of current methods for characterizing virulence and pathogenicity potential of industrial Saccharomyces cerevisiae strains towards humans

TL;DR: Risk assessment of S. cerevisiae strains would benefit from more research towards the comparison of virulent and non-virulent strains in order to better understand those genotypic and phenotypic traits most likely to be associated with pathogenicity.
Journal ArticleDOI

Variational Information Bottleneck for Unsupervised Clustering: Deep Gaussian Mixture Embedding

TL;DR: In this paper, an unsupervised generative clustering framework that combines the Variational Information Bottleneck and the Gaussian Mixture Model is proposed, where the latent space is modeled as a mixture of Gaussians.
Proceedings ArticleDOI

The Price of Local Fairness in Multistage Selection

TL;DR: In this paper, the authors study fairness in multiple stage selection problems where additional features are observed at every stage and propose a simple model based on a probabilistic formulation and show that the locally and globally fair selections that maximize precision can be computed via a linear program.