13 papers · ranked by Valyu relevance
Frank de Meijer, Renata Sotirov, Angelika Wiegele, Shudian Zhao
The graph partition problem (GPP) aims at clustering the vertex set of a graph into a fixed number of disjoint subsets of given sizes such that the sum of weights of edges joining different sets is minimized. This paper investigates the quality of doubly nonnegative (DNN) relaxations, i.e., relaxations having matrix…
Claudio Vestini, Idris Kempf
Constrained quadratic programs and Euclidean projections are ubiquitous in engineering, arising in machine learning, estimation, control, and signal processing. Dykstra's algorithm is an iterative scheme for computing the Euclidean projection of an initial point onto the intersection of convex sets by successively…
Matthew Chou
We consider the problem of finding a "fair" meeting place when S people want to get together. Specifically, we will consider the cases where a "fair" meeting place is defined to be either 1) a node on a graph that minimizes the maximum time/distance to each person or 2) a node on a graph that minimizes the sum of…
Hermina Petric Maretić, Mireille El Gheche, Matthias Minder, Giovanni Chierchia + 1 more
'Giovanni Chierchia' 'Pascal Frossard'] We propose a novel method for comparing nonaligned graphs of different sizes, based on the Wasserstein distance between graph signal distributions induced by the respective graph Laplacian matrices. Specifically, we cast a new formulation for the one-to-many graph alignment…
Xiaozhou Wang, Ting Kei Pong
Given closed convex sets Ci, i = 1, . . . , ℓ, and some nonzero linear maps Ai, i = 1, . . . , ℓ, of suitable dimensions, the multi-set split feasibility problem aims at finding a point in Tℓ i=1 A −1 i Ci based on computing projections onto Ci and multiplications by Ai and AT i . In this paper, we consider the…
Adam Karczmarz, Wojciech Nadara, Marek Sokołowski
Exact computation of shortest paths in weighted graphs has been traditionally studied in one of two settings. First, one can assume that the edge weights are real numbers and all the performed operations on reals (typically comparisons and additions) take constant time. Classical Dijkstra's and Bellman-Ford algorithms…
Carolina Fernandez Pujol, Elizabeth G. Blundon, Andrew R. Dykstra
How perception of sensory stimuli emerges from brain activity is a fundamental question of neuroscience. To date, two disparate lines of research have examined this question. On one hand, human neuroimaging studies have helped us understand the large-scale brain dynamics of perception. On the other hand, work in animal…
Abhishek Patil, Jungyun Bae, Myoungkuk Park, Andrey V. Savkin
This paper proposes an algorithm that provides operational strategies for multiple heterogeneous mobile robot systems utilized in many real-world applications, such as deliveries, surveillance, search and rescue, monitoring, and transportation. Specifically, the authors focus on developing an algorithm that solves a…
Lionel Zoubritzky, François-Xavier Coudert
We present here an open-source Julia library for the topological identification of crystalline materials, with algorithmic and computational improvements over the previously available software in the field, resulting in a speed increase of one order of magnitude. This new algorithm and implementation can therefore be…
S. L. Dykstra, B. Dzwonkowski
Destructive coastal floods are commonly increasing in frequency and may be caused by global precipitation intensification. Such connections through climate, watershed, and river processes are poorly understood because of complex interactions in transitional fluvial-marine environments where flooding is caused by…
Pier Paolo Poir, Louis Lagardère, Jean-Philip Piquemal
We propose a new strategy to solve the Tkatchenko-Scheffler Many-Body Dispersion (MBD) model’s equations. Our approach overcomes the original O(N**3) computational complexity that limits its applicability to large molecular systems within thecontext of O(N) Density Functional Theory (DFT). First, in order to generate…
Steven L. Dykstra, Brian Dzwonkowski, Raymond Torres
As tides propagate inland, they become distorted by channel geometry and river discharge. Tidal dynamics in fluvial-marine transitions are commonly observed in high-energy tidal environments with relatively steady river conditions, leaving the effects of variable river discharge on tides and longitudinal changes poorly…
Zuxi Chen, ShiFan Zhang, XianLi Zeng, Meng Mei + 3 more
'Lixiao Zheng' 'Sedat Akleylek'] This article presents a novel parallel path detection algorithm for identifying suspicious fraudulent accounts in large-scale banking transaction graphs. The proposed algorithm is based on a three-step approach that involves constructing a directed graph, shrinking strongly connected…