Matthew Brennan
Matthew Brennan
PhD Student in EECS, MIT
Verifierad e-postadress på mit.edu - Startsida
Titel
Citeras av
Citeras av
År
Reducibility and computational lower bounds for problems with planted sparse structure
M Brennan, G Bresler, W Huleihel
2018 Conference on Learning Theory, 48-166, 2018
442018
On the importance of location and features for the patch-based segmentation of parotid glands
C Wachinger, M Brennan, G Sharp, P Golland
MICCAI Workshop on Image-Guided Adaptive Radiation Therapy, 2014
192014
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness
M Brennan, G Bresler
2019 Conference on Learning Theory, 469-470, 2019
182019
Reducibility and Statistical-Computational Gaps from Secret Leakage
M Brennan, G Bresler
2020 Conference on Learning Theory, 648-847, 2020
11*2020
Universality of computational lower bounds for submatrix detection
M Brennan, G Bresler, W Huleihel
2019 Conference on Learning Theory, 417-468, 2019
102019
Efficient descriptor-based segmentation of parotid glands with nonlocal means
C Wachinger, M Brennan, GC Sharp, P Golland
IEEE Transactions on Biomedical Engineering 64 (7), 1492-1502, 2016
92016
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
E Boix-Adserà, M Brennan, G Bresler
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
8*2019
Phase transitions for detecting latent geometry in random graphs
M Brennan, G Bresler, D Nagaraj
Probability Theory and Related Fields, 1-75, 2020
22020
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent
M Brennan, G Bresler, SB Hopkins, J Li, T Schramm
arXiv preprint arXiv:2009.06107, 2020
12020
Ramsey numbers of trees versus odd cycles
M Brennan
Electronic Journal of Combinatorics 23 (3), P3.2, 2015
12015
Ramsey numbers of trees and unicyclic graphs versus fans
M Brennan
Discrete Mathematics 340 (5), 969-983, 2017
2017
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–11