Related papers: Potent and Max-Flow Algorithms
In this work a method for reconstructing velocity and acceleration fields is described which uses scattered particle tracking data from flow experiments as input. The goal is to reconstruct these fields faithfully with a limited amount of…
We propose an exact algorithm for solving the longest simple path problem between two given vertices in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster…
We show that accelerated optimization methods can be seen as particular instances of multi-step integration schemes from numerical analysis, applied to the gradient flow equation. In comparison with recent advances in this vein, the…
We study the problem of finding the maximum of a function defined on the nodes of a connected graph. The goal is to identify a node where the function obtains its maximum. We focus on local iterative algorithms, which traverse the nodes of…
The development of self-propelled particles at the micro- and the nanoscale has sparked a huge potential for future applications in active matter physics, microsurgery, and targeted drug delivery. However, while the latter applications…
An optimization method used in image-processing (metamorphosis) is found to imply Euler's equations for incompressible flow of an inviscid fluid, without requiring that the Lagrangian particle labels exactly follow the flow lines of the…
We describe an optimal signal extraction process for imaging X-ray polarimetry using an ensemble of deep neural networks. The initial photo-electron angle, used to recover the polarization, has errors following a von Mises distribution.…
This paper tackles the unconstrained minimization of a class of nonsmooth and nonconvex functions that can be written as finite max-functions. A gradient and function-based sampling method is proposed which, under special circumstances,…
Representations of propagators by means of path integrals over velocities are discussed both in nonrelativistic and relativistic quantum mechanics. It is shown that all the propagators can only be expressed through bosonic path integrals…
It is shown that the average magnitude - redshift diagram for a magnitude-limited sample of galaxies can be effectively used for mapping galaxy velocity field. This new approach is quantitatively introduced and applied to the CfA, ESO/LV…
We show how to combine two techniques for efficiently computing shortest paths in directed planar graphs. The first is the linear-time shortest-path algorithm of Henzinger, Klein, Subramanian, and Rao [STOC'94]. The second is Fakcharoenphol…
We present a novel algorithm for dynamic routing with dedicated path protection which, as the presented simulation results suggest, can be efficient and exact. We present the algorithm in the setting of optical networks, but it should be…
(Neal and Hinton, 1998) recast maximum likelihood estimation of any given latent variable model as the minimization of a free energy functional $F$, and the EM algorithm as coordinate descent applied to $F$. Here, we explore alternative…
We develop novel neural network-based implicit particle methods to compute high-dimensional Wasserstein-type gradient flows with linear and nonlinear mobility functions. The main idea is to use the Lagrangian formulation in the…
This study deals with the problem of optimizing transmit power in high density heterogeneous networks. In the communication network, effective methods of allocating transmit power, in order to reduce the total transmit power, but still…
Devising optimal interventions for constraining stochastic systems is a challenging endeavour that has to confront the interplay between randomness and nonlinearity. Existing methods for identifying the necessary dynamical adjustments…
In the first of these two papers we demonstrated that assuming streams delineate orbits can lead to order one errors in potential parameters for realistic Galactic potentials. Motivated by the need for an improvement on orbit-fitting, we…
We present a combinatorial algorithm for computing exact maximum flows in directed graphs with $n$ vertices and edge capacities from $\{1,\dots,U\}$ in $n^{2+o(1)}\log U$ time, which is almost optimal in dense graphs. Our algorithm is a…
In this paper, we bound the integrality gap and the approximation ratio for maximum plane multiflow problems and deduce bounds on the flow-cut-gap. Planarity means here that the union of the supply and demand graph is planar. We first prove…
In this paper we consider random access wireless multi-hop mesh networks with multi-packet reception capabilities where multiple flows are forwarded to the gateways through node disjoint paths. We address the issue of aggregate…