Spremljaj
Suhas Thejaswi
Suhas Thejaswi
Preverjeni e-poštni naslov na mpi-sws.org
Naslov
Navedeno
Navedeno
Leto
Diversity-Aware k-median: Clustering with Fair Center Representation
S Thejaswi, B Ordozgoiti, A Gionis
Machine Learning and Knowledge Discovery in Databases. Research Track …, 2021
222021
Restless reachability problems in temporal graphs
S Thejaswi, J Lauri, A Gionis
arXiv preprint arXiv:2010.08423, 2020
82020
Finding path motifs in large temporal graphs using algebraic fingerprints
S Thejaswi, A Gionis, J Lauri
Big Data 8 (5), 335-362, 2020
62020
Approximation algorithms for -median with lower-bound constraints
A Gadekar, B Ordozgoiti, S Thejaswi
arXiv e-prints, arXiv: 2112.07030, 2021
5*2021
Pattern detection in large temporal graphs using algebraic fingerprints∗
S Thejaswi, A Gionis
Proceedings of the 2020 SIAM International Conference on Data Mining, 37-45, 2020
42020
Engineering motif search for large motifs
P Kaski, J Lauri, S Thejaswi
17th International Symposium on Experimental Algorithms (SEA 2018), 2018
32018
Approximate computation of frequency moments
S Thejaswi, C Westrup
Aalto University 1, 2016
22016
Prediction-Powered Ranking of Large Language Models
I Chatzi, E Straitouri, S Thejaswi, MG Rodriguez
arXiv preprint arXiv:2402.17826, 2024
12024
Diversity-aware clustering: Computational Complexity and Approximation Algorithms
S Thejaswi, A Gadekar, B Ordozgoiti, A Gionis
arXiv preprint arXiv:2401.05502, 2024
2024
Fair Column Subset Selection
A Matakos, B Ordozgoiti, S Thejaswi
arXiv preprint arXiv:2306.04489, 2023
2023
Scalable algorithm designs for mining massive datasets
S Thejaswi
Aalto University, 2022
2022
Diversity-Aware k-median
S Thejaswi, B Ordozgoiti, A Gionis
Springer, 2021
2021
Scalable Parameterised Algorithms for two Steiner Problems
S Muniyappa
2017
Engineering Motif Search for GPGPU Microarchitectures
ST Muniyappa
2017
Finding path motifs in temporal graphs using algebraic fingerprints
S Thejaswi
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–15