Zobrazeno 1 - 10
of 64
pro vyhledávání: '"Ames, Brendan"'
Autor:
Bombina, Polina, Ames, Brendan
We consider the densest $k$-subgraph problem, which seeks to identify the $k$-node subgraph of a given input graph with maximum number of edges. This problem is well-known to be NP-hard, by reduction to the maximum clique problem. We propose a new co
Externí odkaz:
http://arxiv.org/abs/1904.03272
Linear discriminant analysis (LDA) is a classical method for dimensionality reduction, where discriminant vectors are sought to project data to a lower dimensional space for optimal separability of classes. Several recent papers have outlined strateg
Externí odkaz:
http://arxiv.org/abs/1705.07194
Autor:
Pirinen, Aleksis, Ames, Brendan
As a model problem for clustering, we consider the densest k-disjoint-clique problem of partitioning a weighted complete graph into k disjoint subgraphs such that the sum of the densities of these subgraphs is maximized. We establish that such subgra
Externí odkaz:
http://arxiv.org/abs/1603.05296
Autor:
Horstmeyer, Roarke, Chen, Richard Y., Ou, Xiaoze, Ames, Brendan, Tropp, Joel A., Yang, Changhuei
Ptychography is a powerful computational imaging technique that transforms a collection of low-resolution images into a high-resolution sample reconstruction. Unfortunately, algorithms that are currently used to solve this reconstruction problem lack
Externí odkaz:
http://arxiv.org/abs/1412.1209
Autor:
Ames, Brendan P. W., Hong, Mingyi
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 task, we propose a heuristic, called sparse zero-varian
Externí odkaz:
http://arxiv.org/abs/1401.5492
Autor:
Ames, Brendan, Beveridge, Andrew, Carlson, Rosalie, Djang, Claire, Isler, Volkan, Ragain, Stephen, Savage, Maxray
We study pursuit-evasion in a polygonal environment with polygonal obstacles. In this turn based game, an evader $e$ is chased by pursuers $p_1, p_2, ..., p_{\ell}$. The players have full information about the environment and the location of the othe
Externí odkaz:
http://arxiv.org/abs/1401.2960
Autor:
Ames, Brendan P. W.
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 and 11 norms. Although the original combinatorial
Externí odkaz:
http://arxiv.org/abs/1305.4891
Autor:
Ames, Brendan P. W.
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 goal is to identify the collection of k disjoint cli
Externí odkaz:
http://arxiv.org/abs/1202.3663
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 to find within the graph k disjoint cliques that co
Externí odkaz:
http://arxiv.org/abs/1008.2814
Autor:
Ames, Brendan, Vavasis, Stephen
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 and then relax them using the nuclear norm. This t
Externí odkaz:
http://arxiv.org/abs/0901.3348