Thomas Bühler

Researcher, Gen Digital Inc.

Joined

July 2019

Names

Thomas Bühler

Emails

****@avira.com (Confirmed)

****@gmail.com (Confirmed)

****@gmx.de (Confirmed)

****@gendigital.com (Confirmed)

Personal Links

Google Scholar

DBLP

ORCID

Career & Education History

Researcher

Gen Digital Inc. (gendigital.com)

2022 – Present

Researcher

NortonLifeLock (nortonlifelock.com)

2021 – 2022

Researcher

Avira (avira.com)

2015 – 2021

PhD student

Saarland University (uni-saarland.de)

2009 – 2015

Advisors, Relations & Conflicts

PhD Advisor

Matthias Hein

2009 – 2015

Expertise

graph-based methods

Present

optimization

Present

unsupervised learning

Present

Publications

Speeding up k-means by approximating Euclidean distances via block vectors
Thomas Bottesch, Thomas Bühler, Markus Kächele
- 2016 (modified: 11 Nov 2022)
- ICML 2016
- Readers: Everyone
Towards realistic team formation in social networks based on densest subgraphs
Syama Sundar Rangapuram, Thomas Bühler, Matthias Hein
- 2013 (modified: 12 Nov 2022)
- WWW 2013
- Readers: Everyone
Constrained fractional set programs and their application in local clustering and community detection
Thomas Bühler, Syama Sundar Rangapuram, Simon Setzer, Matthias Hein
- 2013 (modified: 11 Nov 2022)
- ICML (1) 2013
- Readers: Everyone
An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA
Matthias Hein, Thomas Bühler
- 2010 (modified: 11 Nov 2022)
- NIPS 2010
- Readers: Everyone
Spectral clustering based on the graph p-Laplacian
Thomas Bühler, Matthias Hein
- 2009 (modified: 06 Nov 2022)
- ICML 2009
- Readers: Everyone
Robust Variational Reconstruction from Multiple Views
Natalia Slesareva, Thomas Bühler, Kai Uwe Hagenburg, Joachim Weickert, Andrés Bruhn, Zachi Karni, Hans-Peter Seidel
- 2007 (modified: 05 Nov 2022)
- SCIA 2007
- Readers: Everyone

Thomas Bühler

Names

Emails

Personal Links

Career & Education History

Advisors, Relations & Conflicts

Expertise

Publications

Speeding up k-means by approximating Euclidean distances via block vectors

Towards realistic team formation in social networks based on densest subgraphs

Constrained fractional set programs and their application in local clustering and community detection

An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA

Spectral clustering based on the graph p-Laplacian

Robust Variational Reconstruction from Multiple Views

Co-Authors