相关论文: A thresholding algorithm to Willmore-type flows vi…
We establish a minimal positive existence time of the parametric Willmore flow for any smooth initial data (smooth immersion of a closed oriented surface). The minimal existence time is a function exclusively of geometric data which in…
This paper deals with a class of initial-boundary value problems for nonlinear fourth order parabolic systems with time dependent coefficients in a bounded domain $\Omega \subset \mathbb{R}^N, N\geq 2$. Introducing suitable conditions on…
We introduce a Yamabe-type flow \begin{align*} \left\{ \begin{array}{ll} \frac{\partial g}{\partial t} &=(r^m_{\phi}-R^m_{\phi})g \\ \frac{\partial \phi}{\partial t} &=\frac{m}{2}(R^m_{\phi}-r^m_{\phi}) \end{array} \right. ~~\mbox{ in }M…
We consider approximation algorithms for the problem of finding $x$ of minimal norm $\|x\|$ satisfying a linear system $\mathbf{A} x = \mathbf{b}$, where the norm $\|\cdot \|$ is arbitrary and generally non-Euclidean. We show a simple…
In this paper we provide an algorithm which given any $m$-edge $n$-vertex directed graph with integer capacities at most $U$ computes a maximum $s$-$t$ flow for any vertices $s$ and $t$ in $m^{4/3+o(1)}U^{1/3}$ time. This improves upon the…
This letter describes a method for estimating regions of attraction and bounds on permissible perturbation amplitudes in nonlinear fluids systems. The proposed approach exploits quadratic constraints between the inputs and outputs of the…
The split Bregman framework for Osher-Sol\'e-Vese (OSV) model and fourth order total variation flow are studied. We discretize the problem by piecewise constant function and compute $\nabla(-\Delta_{\mathrm{av}})^{-1}$ approximately and…
The All-Pairs Min-Cut problem (aka All-Pairs Max-Flow) asks to compute a minimum $s$-$t$ cut (or just its value) for all pairs of vertices $s,t$. We study this problem in directed graphs with unit edge/vertex capacities (corresponding to…
An optical flow variational model is proposed for a sequence of images defined on a domain in $\mathbb{R}^2$. We introduce a regularization term given by the $L^1$ norm of a fractional differential operator. To solve the minimization…
We present an algorithm for computing $s$-$t$ maximum flows in directed graphs in $\widetilde{O}(m^{4/3+o(1)}U^{1/3})$ time. Our algorithm is inspired by potential reduction interior point methods for linear programming. Instead of using…
This paper examines the Balanced Submodular Flow Problem, that is the problem of finding a feasible submodular flow minimizing the difference between the flow values along the edges. A min-max formula is given to the problem and an…
A boundary value problem related to a parabolic higher order operator with a small parameter is analized. When the small parameter tends to zero, the reduced operator is hyperbolic. When t tends to infinity a parabolic hyperbolic boundary…
We provide an algorithm which, with high probability, maintains a $(1-\epsilon)$-approximate maximum flow on an undirected graph undergoing $m$-edge additions in amortized $m^{o(1)} \epsilon^{-3}$ time per update. To obtain this result, we…
A normalizing flow (NF) is a mapping that transforms a chosen probability distribution to a normal distribution. Such flows are a common technique used for data generation and density estimation in machine learning and data science. The…
The well-posedness of a phase-field approximation to the Willmore flow with area and volume constraints is established when the functional approximating the area has no critical point satisfying the two constraints. The existence proof…
The one-way measurement model is a framework for universal quantum computation, in which algorithms are partially described by a graph G of entanglement relations on a collection of qubits. A sufficient condition for an algorithm to perform…
Sampling a target probability distribution with an unknown normalization constant is a fundamental challenge in computational science and engineering. Recent work shows that algorithms derived by considering gradient flows in the space of…
The third-order Jeffery-Hamel ODE governing the flow of an incompressible fluid in a two-dimensional wedge is briefly derived, and a C^1 finite element formulation of the equation is developed. This formulation has several advantages,…
Gradient-based (a.k.a. `first order') optimization algorithms are routinely used to solve large scale non-convex problems. Yet, it is generally hard to predict their effectiveness. In order to gain insight into this question, we revisit the…
We design new polynomials for representing threshold functions in three different regimes: probabilistic polynomials of low degree, which need far less randomness than previous constructions, polynomial threshold functions (PTFs) with…