Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Yves van Gennip"'
Publikováno v:
European Journal of Applied Mathematics, Pp 1-83
In network science, one of the significant and challenging subjects is the detection of communities. Modularity [1] is a measure of community structure that compares connectivity in the network with the expected connectivity in a graph sampled from a
Externí odkaz:
https://doaj.org/article/3e64158575984b6f89d2098ff1752c80
Autor:
Jeremy Budd, Yves van Gennip
Publikováno v:
SIAM Journal on Mathematical Analysis
In recent years there has been an emerging interest in PDE-like flows defined on finite graphs, with applications in clustering and image segmentation. In particular for image segmentation and semi...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81117830ee3d05eb46d4052cc71301ad
https://doi.org/10.1137/19m1277394
https://doi.org/10.1137/19m1277394
Publikováno v:
GAMM Mitteilungen, 44(1)
This paper introduces a semi-discrete implicit Euler (SDIE) scheme for the Allen-Cahn equation (ACE) with fidelity forcing on graphs. Bertozzi and Flenner (2012) pioneered the use of this differential equation as a method for graph classification pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed3dd19cb6cb7e1f933ecb49fd291da8
http://resolver.tudelft.nl/uuid:dab8978d-11b1-4915-a6a3-6890162a7b74
http://resolver.tudelft.nl/uuid:dab8978d-11b1-4915-a6a3-6890162a7b74
Publikováno v:
European Journal of Applied Mathematics. 28:877-885
Partial differential equations (PDEs) are expressions involving an unknown function in many independent variables and their partial derivatives up to a certain order. Since PDEs express continuous change, they have long been used to formulate a myria
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8540bf67d2ef15ca4185c57551c2fcaa
https://doi.org/10.1017/s0956792517000304
https://doi.org/10.1017/s0956792517000304
Autor:
Blaine Keetch, Yves van Gennip
Publikováno v:
Discrete and Continuous Dynamical Systems. Series B, 24(11)
Discrete & Continuous Dynamical Systems-B
Discrete & Continuous Dynamical Systems-B
The Max-Cut problem is a well known combinatorial optimization problem. In this paper we describe a fast approximation method. Given a graph G, we want to find a cut whose size is maximal among all possible cuts. A cut is a partition of the vertex se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1dd44580a97d3460a242f02e61b0bbd6
http://resolver.tudelft.nl/uuid:85a98005-6f8e-483e-81e9-6ed63b21f6db
http://resolver.tudelft.nl/uuid:85a98005-6f8e-483e-81e9-6ed63b21f6db
Publikováno v:
Cucuringu, M, Pizzoferrato, A & Van Gennip, Y 2021, ' An MBO scheme for clustering and semi-supervised clustering of signed networks ', Communications in Mathematical Sciences, vol. 19, no. 1, pp. 73-109 . https://doi.org/10.4310/CMS.2021.v19.n1.a4
Communications in Mathematical Sciences
Communications in Mathematical Sciences, 19(1)
Communications in Mathematical Sciences
Communications in Mathematical Sciences, 19(1)
We introduce a principled method for the signed clustering problem, where the goal is to partition a weighted undirected graph whose edge weights take both positive and negative values, such that edges within the same cluster are mostly positive, whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9fda4a0c3c4ee18b50db27de9474541c
Autor:
Blanche Buet, Jean-Marie Mirebeau, Yves van Gennip, François Desquilbet, Johann Dreo, Frédéric Barbaresco, Gian Paolo Leonardi, Simon Masnou, Carola-Bibiane Schönlieb
Publikováno v:
SMAI Journal of Computational Mathematics
SMAI Journal of Computational Mathematics, Société de Mathématiques Appliquées et Industrielles (SMAI), 2019, S5, pp.109-128. ⟨10.5802/smai-jcm.55⟩
The SMAI journal of computational mathematics
SMAI Journal of Computational Mathematics, Société de Mathématiques Appliquées et Industrielles (SMAI), 2019, S5, pp.109-128. ⟨10.5802/smai-jcm.55⟩
The SMAI journal of computational mathematics
This paper arose from a minisymposium held in 2018 at the 9th International Conference on Curves and Surface in Arcachon, France, and organized by Simon Masnou and Carola-Bibiane Schonlieb. This minisymposium featured a variety of recent developments
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb1f33902b0784b67de672f8db406c58
https://hal.archives-ouvertes.fr/hal-03030417
https://hal.archives-ouvertes.fr/hal-03030417
Autor:
Yves van Gennip
Publikováno v:
Journal of Nonlinear Science
We study a graph based version of the Ohta-Kawasaki functional, which was originally introduced in a continuum setting to model pattern formation in diblock copolymer melts and has been studied extensively as a paradigmatic example of a variational m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d9ff3e8e02fe79b66067894459fb137
Autor:
Hui Yang, Selene J. Huntley, Marnie L. Brennan, Michaela Mahlberg, Viola Wiegand, Yves van Gennip, Rachel Dean
The use of corpus linguistic techniques and other related mathematical analyses have rarely, if ever, been applied to qualitative data collected from the veterinary field. The aim of this study was to explore the use of a combination of corpus lingui
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ff1cca409826e6581d434f935f9f013
https://nottingham-repository.worktribe.com/file/909157/1/1-s2.0-S0167587717300223-main.pdf
https://nottingham-repository.worktribe.com/file/909157/1/1-s2.0-S0167587717300223-main.pdf
Publikováno v:
IEEE Transactions on Image Processing. 24:2864-2873
QR bar codes are prototypical images for which part of the image is a priori known (required patterns). Open source bar code readers, such as ZBar, are readily available. We exploit both these facts to provide and assess purely regularization-based m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33883a6aa5c2050af8b412f27a5bbf45
https://doi.org/10.1109/tip.2015.2432675
https://doi.org/10.1109/tip.2015.2432675