Follow
Brendan Ames
Title
Cited by
Cited by
Year
Nuclear norm minimization for the planted clique and biclique problems
BPW Ames, SA Vavasis
Mathematical programming 129 (1), 69-89, 2011
1302011
Solving ptychography with a convex relaxation
R Horstmeyer, RY Chen, X Ou, B Ames, JA Tropp, C Yang
New journal of physics 17 (5), 053044, 2015
1172015
Guaranteed clustering and biclustering via semidefinite programming
BPW Ames
Mathematical Programming 147 (1), 429-465, 2014
642014
Convex optimization for the planted k-disjoint-clique problem
BPW Ames, SA Vavasis
Mathematical Programming 143 (1), 299-337, 2014
592014
Alternating direction method of multipliers for penalized zero-variance discriminant analysis
BPW Ames, M Hong
arXiv preprint arXiv:1401.5492 26, 2014
392014
Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation
BPW Ames
Journal of Optimization Theory and Applications 167 (2), 653-675, 2015
25*2015
A leapfrog strategy for pursuit-evasion in a polygonal environment
B Ames, A Beveridge, R Carlson, C Djang, V Isler, S Ragain, M Savage
International Journal of Computational Geometry & Applications 25 (02), 77-100, 2015
152015
Proximal methods for sparse optimal scoring and discriminant analysis
S Atkins, G Einarsson, B Ames, L Clemmensen
arXiv preprint arXiv:1705.07194, 2017
72017
Exact clustering of weighted graphs via semidefinite programming
A Pirinen, B Ames
The Journal of Machine Learning Research 20 (1), 1007-1040, 2019
6*2019
Derivatives of compound matrix valued functions
BPW Ames, HS Sendov
Journal of Mathematical Analysis and Applications 433 (2), 1459-1485, 2016
62016
Convex optimization for the densest subgraph and densest submatrix problems
P Bombina, B Ames
SN Operations Research Forum 1 (3), 1-24, 2020
42020
Convex relaxation for the planted clique, biclique, and clustering problems
B Ames
University of Waterloo, 2011
42011
Asymptotic expansions of the ordered spectrum of symmetric matrices
BPW Ames, HS Sendov
Nonlinear Analysis: Theory, Methods & Applications 72 (11), 4288-4297, 2010
32010
Classification of visual comprehension based on EEG data using sparse optimal scoring
LK Ford, JD Borneman, J Krebs, EA Malaia, BP Ames
Journal of Neural Engineering 18 (2), 026025, 2021
22021
A new derivation of a formula by Kato
BPW Ames, HS Sendov
Linear algebra and its applications 436 (3), 722-730, 2012
22012
A sparse regression approach for evaluating and predicting NHL results
N Laffey, B Ames
December, 2016
12016
Salience of low-frequency entrainment to visual signal for classification points to predictive processing in sign language. In Proceedings of 30th Annual Computational …
E Malaia, LK Ford
Journal of Computational Neuroscience 49 (S1), 2021
2021
How to Reliably Find a Hidden Clique
B Ames
2017
Taylor expansions of the spectrum of a symmetric matrix
BPW Ames
University of Guelph, 2007
2007
Convex relaxation for the planted clique, biclique and cluster problems
B Ames, S Vavasis
The system can't perform the operation now. Try again later.
Articles 1–20