Related papers: 2-FREE-FLOOD-IT is polynomial
Let a cluster (network) of sensors be connected by the communication links, each link having a capacity upper bound. Each sensor observes a discrete random variable in private and one sensor serves as a cluster header or sink. Here, we…
We present FlowDet, the first formulation of object detection using modern Conditional Flow Matching techniques. This work follows from DiffusionDet, which originally framed detection as a generative denoising problem in the bounding box…
Finite difference method and finite element method are popular methods for solving groundwater flow equations. This paper presents a new method that uses gradually varied functions to solve such equation. In this paper, we have established…
Polynomial graph filters and their inverses play important roles in graph signal processing. An advantage of polynomial graph filters is that they can be implemented in a distributed manner, which involves data transmission between adjacent…
Equation-free approaches have been proposed in recent years for the computational study of multiscale phenomena in engineering problems where evolution equations for the coarse-grained, system-level behavior are not explicitly available. In…
Combinatorial optimization (CO) problems are often NP-hard and thus out of reach for exact algorithms, making them a tempting domain to apply machine learning methods. The highly structured constraints in these problems can hinder either…
An emerging trend in approximate counting is to show that certain `low-temperature' problems are easy on typical instances, despite worst-case hardness results. For the class of regular graphs one usually shows that expansion can be…
In this paper, we study robust transshipment under consistent flow constraints. We consider demand uncertainty represented by a finite set of scenarios and characterize a subset of arcs as so-called fixed arcs. In each scenario, we require…
The occurrence of diffusion on a graph is a prevalent and significant phenomenon, as evidenced by the spread of rumors, influenza-like viruses, smart grid failures, and similar events. Comprehending the behaviors of flow is a formidable…
The transient start-up flow solution with slip is a useful tool to verify Computational Fluid Dynamics (CFD) simulations. However, a highly accurate, open-source black box solution does not seem to be available. Our method provides a fast,…
We present a generative AI algorithm for addressing the pressing task of fast, accurate, and robust statistical computation of three-dimensional turbulent fluid flows. Our algorithm, termed as GenCFD, is based on an end-to-end conditional…
We consider the classical evolution of a particle on a graph by using a time-continuous Frobenius-Perron operator which generalizes previous propositions. In this way, the relaxation rates as well as the chaotic properties can be defined…
Solving large complex partial differential equations (PDEs), such as those that arise in computational fluid dynamics (CFD), is a computationally expensive process. This has motivated the use of deep learning approaches to approximate the…
We define a two-player combinatorial game in which players take alternate turns; each turn consists on deleting a vertex of a graph, together with all the edges containing such vertex. If any vertex became isolated by a player's move then…
Flow-based generative modeling in continuous spaces exploit Tweedie's formula to express the denoiser (learned in training) as a score function (used in sampling). In contrast, this relation has been largely missing in the discrete setting…
We explore algorithms to select actions in the causal bandit setting where the learner can choose to intervene on a set of random variables related by a causal graph, and the learner sequentially chooses interventions and observes a sample…
We present a new model for two phase Darcy flows in fractured media, in which fractures are modelled as submanifolds of codimension one with respect to the surrounding domain (matrix). Fractures can act as drains or as barriers, since…
We study a variation of the graph colouring problem on random graphs of finite average connectivity. Given the number of colours, we aim to maximise the number of different colours at neighbouring vertices (i.e. one edge distance) of any…
The problem of mass diffusion in layered systems has relevance to applications in different scientific disciplines, e.g., chemistry, material science, soil science, and biomedical engineering. The mathematical challenge in these type of…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…