#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2011

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Brendan P. W. Ames, Stephen A. Vavasis
- Math. Program.
- 2011

We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph. Both problems are NP-hard. We write both problems as matrix-rank minimizationâ€¦ (More)

We consider the task of classification in the high-dimensional setting where the number of features of the given data is significantly greater than the number of observations. To accomplish thisâ€¦ (More)

- Brendan P. W. Ames, Stephen A. Vavasis
- Math. Program.
- 2014

We consider the k-disjoint-clique problem. The input is an undirected graph G in which the nodes represent data items, and edges indicate a similarity between the corresponding items. The problem isâ€¦ (More)

- Roarke Horstmeyer, Richard Y. Chen, Xiaoze Ou, Brendan P. W. Ames, Joel A. Tropp, Changhuei Yang
- New journal of physics
- 2015

Ptychography is a powerful computational imaging technique that transforms a collection of low-resolution images into a high-resolution sample reconstruction. Unfortunately, algorithms that currentlyâ€¦ (More)

- Brendan P. W. Ames
- Math. Program.
- 2014

Identifying clusters of similar objects in data plays a significant role in a wide range of applications. As a model problem for clustering, we consider the densest k-disjoint-clique problem, whoseâ€¦ (More)

We consider the problem of identifying the densest k-node subgraph in a given graph. We write this problem as an instance of rank-constrained cardinality minimization and then relax using the nuclearâ€¦ (More)

- Brendan P. W. Ames, Mingyi Hong
- Comp. Opt. and Appl.
- 2016

We consider the task of classification in the high-dimensional setting where the number of features of the given data is significantly greater than the number of observations. To accomplish thisâ€¦ (More)

A clique of a graph G is a set of pairwise adjacent nodes of G. Similarly, a biclique (U, V ) of a bipartite graph G is a pair of disjoint, independent vertex sets such that each node in U isâ€¦ (More)

- Brendan P. W. Ames
- J. Optimization Theory and Applications
- 2015

Here Î£ is the cone of semidefinite matrices with entries indexed by V , áº¼ = (V Ã— V )âˆ’E âˆ’ {vv : v âˆˆ V } is the complement of the edge set of G, e is the all-ones vector in R , â€–Y â€–0, â€–Y â€–1, denote theâ€¦ (More)

- Brendan P. W. Ames, Andrew Beveridge, +4 authors Maxray Savage
- Int. J. Comput. Geometry Appl.
- 2015

We study pursuit-evasion in a polygonal environment with polygonal obstacles. In this turn based game, an evader e is chased by pursuers p1, p2, . . . , p`. The players have full information aboutâ€¦ (More)

- â€¹
- 1
- â€º