Related papers: 2-FREE-FLOOD-IT is polynomial
We present a method to downscale idealized geophysical fluid simulations using generative models based on diffusion maps. By analyzing the Fourier spectra of images drawn from different data distributions, we show how one can chain together…
Understanding flood probabilities is essential to making sound decisions about flood-risk management. Many people rely on flood probability maps to inform decisions about purchasing flood insurance, buying or selling real-estate,…
We present an open-source Matlab framework, titled iFluid, for simulating the dynamics of integrable models using the theory of generalized hydrodynamics (GHD). The framework provides an intuitive interface, enabling users to define and…
We present an efficient solver for massively-parallel direct numerical simulations of incompressible turbulent flows. The method uses a second-order, finite-volume pressure-correction scheme, where the pressure Poisson equation is solved…
We present the Douglas-Rachford algorithm as a successful heuristic for solving graph coloring problems. Given a set of colors, these type of problems consist in assigning a color to each node of a graph, in such a way that every pair of…
Flooding is the world's most costly type of natural disaster in terms of both economic losses and human causalities. A first and essential procedure towards flood monitoring is based on identifying the area most vulnerable to flooding,…
We define a new impartial combinatorial game, Flag Coloring, based on flood filling. We then generalize to a graph game, and find values for many positions on two colors. We demonstrate that the generalized game is PSPACE-complete for two…
We study the clustering of bipartite graphs and Boolean matrix factorization in data streams. We consider a streaming setting in which the vertices from the left side of the graph arrive one by one together with all of their incident edges.…
A finite element approach to the elastic flow of a curve coupled with a diffusion equation on the curve is analysed. Considering the graph case, the problem is weakly formulated and approximated with continuous linear finite elements, which…
Burning and cooling are diffusion processes on graphs in which burned (or cooled) vertices spread to their neighbors with a new source picked at discrete time steps. In burning, the one tries to burn the graph as fast as possible, while in…
Graph-based semi-supervised learning usually involves two separate stages, constructing an affinity graph and then propagating labels for transductive inference on the graph. It is suboptimal to solve them independently, as the correlation…
Many problems can be presented in an abstract form through a wide range of binary objects and relations which are defined over problem domain. In these problems, graphical demonstration of defined binary objects and solutions is the most…
This paper deals with a time-split explicit/implicit approach for solving a two-dimensional hydrodynamic flow model with appropriate initial and boundary conditions. The time-split technique is employed to upwind the convection term and to…
Transitivity is a central, generative principle in social and other complex networks, capturing the tendency for two nodes with a common neighbor to form a direct connection. We propose a new model for highly dense, complex networks based…
Diffusion and flow-driven instability, or transport-driven instability, is one of the central mechanisms to generate inhomogeneous gradient of concentrations in spatially distributed chemical systems. However, verifying the transport-driven…
This paper considers the noncooperative maximization of mutual information in the Gaussian interference channel in a fully distributed fashion via game theory. This problem has been studied in a number of papers during the past decade for…
In algorithmic graph theory, a classic open question is to determine the complexity of the Maximum Independent Set problem on $P_t$-free graphs, that is, on graphs not containing any induced path on $t$ vertices. So far, polynomial-time…
We call a system bouncing ball billiard if it consists of a particle that is subjected to a constant vertical force and bounces inelastically on a one-dimendional vibrating periodically corrugated floor. Here we choose circular scatterers…
Given an inverse problem with a normalizing flow prior, we wish to estimate the distribution of the underlying signal conditioned on the observations. We approach this problem as a task of conditional inference on the pre-trained…
In this work, physics-informed neural networks are applied to incompressible two-phase flow problems. We investigate the forward problem, where the governing equations are solved from initial and boundary conditions, as well as the inverse…