Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Brendan P. W. Ames"'
Autor:
Brendan P. W. Ames, Polina Bombina
Publikováno v:
SN Operations Research Forum. 1
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 convex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bbe8f64f53e6b58633d4ad729fb45dbd
https://doi.org/10.1007/s43069-020-00020-5
https://doi.org/10.1007/s43069-020-00020-5
Autor:
Evguenia Malaia, Brendan P. W. Ames, Joshua D. Borneman, Julia Krebs, Linda Katherine Wood Ford
Publikováno v:
Journal of Neural Engineering. 18:026025
Objective. Understanding and differentiating brain states is an important task in the field of cognitive neuroscience with applications in health diagnostics, such as detecting neurotypical development vs. autism spectrum or coma/vegetative state vs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eee3a95bb4d53ed1e1a18721622958ba
https://doi.org/10.1088/1741-2552/abdb3b
https://doi.org/10.1088/1741-2552/abdb3b
Autor:
Brendan P. W. Ames, Hristo S. Sendov
Publikováno v:
Journal of Mathematical Analysis and Applications. 433:1459-1485
Primary matrix functions and spectral functions are two classes of orthogonally invariant functions on a symmetric matrix argument. Many of their properties have been investigated thoroughly and find numerous applications both theoretical and applied
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2196260b980fe911b2156b843b58ec6
https://doi.org/10.1016/j.jmaa.2015.08.029
https://doi.org/10.1016/j.jmaa.2015.08.029
Autor:
Maxray Savage, Volkan Isler, Rosalie Carlson, Andrew Beveridge, Brendan P. W. Ames, Stephen Ragain, Claire Djang
Publikováno v:
International Journal of Computational Geometry & Applications. 25:77-100
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24e25a6f18f92148e7c370a08c908d80
https://doi.org/10.1142/s0218195915500065
https://doi.org/10.1142/s0218195915500065
Autor:
Hristo S. Sendov, Brendan P. W. Ames
Publikováno v:
Linear Algebra and its Applications. 436(3):722-730
If the m th largest eigenvalue λ m ( A ) of a real symmetric matrix A is simple, then λ m ( · ) is an analytic function in a neighbourhood of A . In this note, we provide a new derivation of the classical formulae for the coefficients in the power
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a6c6b11f5d2af8505d35b7a4bc25467
Autor:
Brendan P. W. Ames, Stephen A. Vavasis
Publikováno v:
Mathematical Programming. 129:69-89
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:
https://explore.openaire.eu/search/publication?articleId=doi_________::293dbb9c1ae0a3f659d145a104741e33
https://doi.org/10.1007/s10107-011-0459-x
https://doi.org/10.1007/s10107-011-0459-x
Autor:
Brendan P. W. Ames, Hristo S. Sendov
Publikováno v:
Nonlinear Analysis: Theory, Methods & Applications. 72:4288-4297
In this work, we build on ideas of Torki (2001 [6] ) and show that if a symmetric matrix-valued map t ↦ A ( t ) has a one-sided asymptotic expansion at t = 0 + of order K then so does t ↦ λ m ( A ( t ) ) , where λ m is the m th largest eigenval
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a9c088d08e74b23ecf59b6702bc14df
https://doi.org/10.1016/j.na.2010.02.005
https://doi.org/10.1016/j.na.2010.02.005
Autor:
Brendan P. W. Ames
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 cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a2c1bffb096a09a2a8bf29b4b3b91e14
https://resolver.caltech.edu/CaltechAUTHORS:20141016-101357930
https://resolver.caltech.edu/CaltechAUTHORS:20141016-101357930
Autor:
Brendan P. W. Ames, Stephen A. Vavasis
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 c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bfd7913d0dc00e8c5c6946bc09394a18
https://resolver.caltech.edu/CaltechAUTHORS:20140213-094722877
https://resolver.caltech.edu/CaltechAUTHORS:20140213-094722877
Autor:
Brendan P. W. Ames, Mingyi Hong
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22ddc487d62297c88017715b20acbafd
http://arxiv.org/abs/1401.5492
http://arxiv.org/abs/1401.5492