相关论文: Finding flows in the one-way measurement model
We present a global optimization approach to optical flow estimation. The approach optimizes a classical optical flow objective over the full space of mappings between discrete grids. No descriptor matching is used. The highly regular…
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow problems. Each electrical flow is given by the solution of a…
First we give an introduction to the method of diagonalizing or block-diagonalizing continuously a Hamiltonian and explain how this procedure can be used to analyze the two-dimensional Hubbard model. Then we give a short survey on…
Turbulent flows are chaotic and unsteady, but their statistical distribution converges to a statistical steady state. Engineering quantities of interest typically take the form of time-average statistics such as $ \frac{1}{t} \int_0^t f (…
Geometric flows have proved to be a powerful geometric analysis tool, perhaps most notably in the study of 3-manifold topology, the differentiable sphere theorem, Hermitian-Yang-Mills connections and canonical Kaehler metrics. In the…
The model of open quantum systems is adopted to describe the non-local dynamical behaviour of qubits processed by entangling gates. The analysis gets to the conclusion that a distinction between evaluation steps and task-oriented computing…
The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We prove that a quantum circuit with $T$ gates whose underlying graph has treewidth $d$ can be simulated deterministically in…
It is suggested that the individual outcomes of a measurement process can be understood within standard quantum mechanics in terms of the measuring apparatus, treated as a quantum computer, executing Grover's search algorithm.
Our aim is to study the Total Variation Flow in Metric Graphs. First, we define the functions of bounded variation in Metric Graphs and their total variation, we also give an integration by parts formula. We prove existence and uniqueness…
Considering trajectory curves, integral of n-dimensional dynamical systems, within the framework of Differential Geometry as curves in Euclidean n-space, it will be established in this article that the curvature of the flow, i.e. the…
We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a graph with $n$ vertices, $m$ edges along with a recursive…
This paper focuses on developing an efficient algorithm for analyzing a directed network (graph) from a topological viewpoint. A prevalent technique for such topological analysis involves computation of homology groups and their…
Given an undirected, weighted graph, with $n$ vertices and $m$ edges, and two special vertices $s$ and $t$, the problem is to find the shortest path between them. We give two bounded-error quantum algorithms with improved runtime in the…
We present well-balanced, high-order, semi-discrete numerical schemes for one-dimensional blood flow models with discontinuous mechanical properties and algebraic source terms representing friction and gravity. While discontinuities in…
We show the existence of a global unique and analytic solution for the mean curvature flow, the surface diffusion flow and the Willmore flow of entire graphs for Lipschitz initial data with small Lipschitz norm. We also show the existence…
Cartograms are maps that rescale geographic regions (e.g., countries, districts) such that their areas are proportional to quantitative demographic data (e.g., population size, gross domestic product). Unlike conventional bar or pie charts,…
The fundamental diagram (FD), also known as the flow--density relation, is one of the most fundamental concepts in the traffic flow theory. It describes the relation between equilibrated flow, density, and speed in traffic flow.…
Given a quantum (or statistical) system with a very large number of degrees of freedom and a preferred tensor product factorization of the Hilbert space (or of a space of distributions) we describe how it can be approximated with a very…
An immersion of a graph H in another graph G is a one-to-one mapping phi:V(H)->V(G) and a collection of edge-disjoint paths in G, one for each edge of H, such that the path P_{uv} corresponding to the edge uv has endpoints phi(u) and…
A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in $H$ coincide with the distances between the corresponding vertices in $G$. We show that for any integer $n\ge 1$, there is a graph on $3^{n+O(\log^2 n)}$…