Obserwuj
Brian Brubach
Tytuł
Cytowane przez
Cytowane przez
Rok
It's compaslicated: The messy relationship between rai datasets and algorithmic fairness benchmarks
M Bao, A Zhou, S Zottola, B Brubach, S Desmarais, A Horowitz, K Lum, ...
arXiv preprint arXiv:2106.05498, 2021
1212021
Online Stochastic Matching: New Algorithms and Bounds
B Brubach, KA Sankararaman, A Srinivasan, P Xu
Algorithmica 82 (10), 2737-2783, 2020
101*2020
Probabilistic fair clustering
S Esmaeili, B Brubach, L Tsepenekas, J Dickerson
Advances in Neural Information Processing Systems 33, 12743-12755, 2020
472020
A pairwise fair and community-preserving approach to k-center clustering
B Brubach, D Chakrabarti, J Dickerson, S Khuller, A Srinivasan, ...
International conference on machine learning, 1178-1189, 2020
442020
Fair clustering under a bounded cost
S Esmaeili, B Brubach, A Srinivasan, J Dickerson
Advances in Neural Information Processing Systems 34, 14345-14357, 2021
352021
Attenuate locally, win globally: Attenuation-based frameworks for online stochastic matching with timeouts
B Brubach, KA Sankararaman, A Srinivasan, P Xu
Algorithmica 82, 64-87, 2020
332020
Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints
B Brubach, D Chakrabarti, JP Dickerson, A Srinivasan, L Tsepenekas
arXiv preprint arXiv:2103.02013, 2021
302021
Improved guarantees for offline stochastic matching via new ordered contention resolution schemes
B Brubach, N Grammel, W Ma, A Srinivasan
Advances in Neural Information Processing Systems 34, 27184-27195, 2021
252021
Improved bound for online square-into-square packing
B Brubach
International Workshop on Approximation and Online Algorithms, 47-58, 2014
21*2014
Follow your star: New frameworks for online stochastic matching with known and unknown patience
B Brubach, N Grammel, W Ma, A Srinivasan
International Conference on Artificial Intelligence and Statistics, 2872-2880, 2021
20*2021
Online matching frameworks under stochastic rewards, product ranking, and unknown patience
B Brubach, N Grammel, W Ma, A Srinivasan
Operations Research, 2023
152023
Algorithms to approximate column-sparse packing problems
B Brubach, KA Sankararaman, A Srinivasan, P Xu
ACM Transactions on Algorithms (TALG) 16 (1), 1-32, 2019
122019
Current progress and future opportunities in applications of bioinformatics for biodefense and pathogen detection: report from the Winter Mid-Atlantic Microbiome Meet-up …
JS Meisel, DJ Nasko, B Brubach, V Cepeda-Espinoza, J Chopyk, ...
Microbiome 6, 1-10, 2018
112018
Further improvement in approximating the maximum duo-preservation string mapping problem
B Brubach
International Workshop on Algorithms in Bioinformatics, 52-64, 2016
112016
Fair labeled clustering
SA Esmaeili, S Duppala, JP Dickerson, B Brubach
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and …, 2022
102022
Meddling metrics: the effects of measuring and constraining partisan gerrymandering on voter incentives
B Brubach, A Srinivasan, S Zhao
Proceedings of the 21st ACM Conference on Economics and Computation, 815-833, 2020
92020
A succinct four Russians speedup for edit distance computation and one-against-many banded alignment
B Brubach, J Ghurye
29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 13: 1-13: 12, 2018
52018
Better greedy sequence clustering with fast banded alignment
B Brubach, J Ghurye, M Pop, A Srinivasan
17th International Workshop on Algorithms in Bioinformatics (WABI 2017), 3 …, 2017
42017
Fairness in clustering
P Awasthi, B Brubach, D Chakrabarty, JP Dickerson, SA Esmaeili, ...
Conference on Artificial Intelligence (AAAI), 2022
32022
Centralized fairness for redistricting
SA Esmaeili, H Grape, B Brubach
arXiv preprint arXiv:2203.00872, 2022
32022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20