Zobrazeno 1 - 9
of 9
pro vyhledávání: '"ROSSI, ALFRED"'
Autor:
Rossi, Alfred Vincent, III
This thesis addresses clustering problems in two distinct settings. In the first setting we explore the notion of what it means for a graph to admit a good partition into k-clusters. We say a partition of a graph is strong if each cluster has small e
We study hierarchical clusterings of metric spaces that change over time. This is a natural geometric primitive for the analysis of dynamic data sets. Specifically, we introduce and study the problem of finding a temporally coherent sequence of hiera
Externí odkaz:
http://arxiv.org/abs/1707.09904
We study the problem of clustering sequences of unlabeled point sets taken from a common metric space. Such scenarios arise naturally in applications where a system or process is observed in distinct time intervals, such as biological surveys and con
Externí odkaz:
http://arxiv.org/abs/1704.05964
A popular graph clustering method is to consider the embedding of an input graph into R^k induced by the first k eigenvectors of its Laplacian, and to partition the graph via geometric manipulations on the resulting metric space. Despite the practica
Externí odkaz:
http://arxiv.org/abs/1404.1008
Publikováno v:
In Computational Geometry: Theory and Applications January 2019 76:19-32
We describe the Polyak-Viro arrow diagram formulas for the coefficients of the Conway polynomial. As a consequence, we obtain the Conway polynomial as a state sum over some subsets of the crossings of the knot diagram. It turns out to be a simplifica
Externí odkaz:
http://arxiv.org/abs/0810.3146
Publikováno v:
In The American Journal of Surgery 2011 201(3):359-362
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Rossi, Alfred J.
Publikováno v:
ACM SIGCSE Bulletin; Sep1999, Vol. 31 Issue 3, p196-N-PAG, 1p