Memory Efficient Max Flow for Multi-Label Submodular MRFs

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

Quantum random number generators (QRNGs) are a burgeoning technology used for a variety of applications, including modern security and encryption systems. Typical methods exploit an entropy source combined with an extraction or bit generation circuit in or ...

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really gener ...

With Moore's law coming to an end, increasingly more hope is being put in specialized hardware implemented on reconfigurable architectures such as Field-Programmable Gate Arrays (FPGAs). Yet, it is often neglected that these architectures themselves experi ...

One of the most basic graph problems, All-Pairs Shortest Paths (APSP) is known to be solvable in n^{3-o(1)} time, and it is widely open whether it has an O(n^{3-ε}) time algorithm for ε > 0. To better understand APSP, one often strives to obtain subcubic t ...

Tensile and creep rupture properties of crack-free CM247LC alloy, processed via laser powder bed fusion, have been characterised in this work at temperatures up to 1000 & DEG;C. The subject alloy matches or even exceeds the tensile performance of its direc ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

This thesis focuses on the maximum matching problem in modern computational settings where the algorithms have to make decisions with partial information. First, we consider two stochastic models called query-commit and price-of-information where the algo ...

Cycles are one of the fundamental subgraph patterns and being able to enumerate them in graphs enables important applications in a wide variety of fields, including finance, biology, chemistry, and network science. However, to enable cycle enumeration in r ...

Deep-learning-based digital twins (DDT) are a promising tool for data-driven system health management because they can be trained directly on operational data. A major challenge for efficient training however is that industrial datasets remain unlabeled. T ...

We study different symbolic algorithms to solve two related reconfiguration problems on graphs: the token swapping problem and the permutation routing via matchings problem. Input to both problems is a connected graph with labeled vertices and a token in e ...

Finding cycles in directed graphs enables important applications in various domains such as finance, biology, chemistry, and network science. However, as the size of graph datasets continues to grow, it becomes increasingly difficult to discover cycles wit ...

The emergence of Big Data has enabled new research perspectives in the discrete choice community. While the techniques to estimate Machine Learning models on a massive amount of data are well established, these have not yet been fully explored for the esti ...

Acoustic emission (AE) monitoring is commonly used to inspect the health of a structure continuously. During fracture processes elastic waves of AE are created and emitted, and sensors can capture these waves. The acquired signals can be processed to track ...

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut (MAXCUT) in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communica ...

Many important problems in contemporary machine learning involve solving highly non- convex problems in sampling, optimization, or games. The absence of convexity poses significant challenges to convergence analysis of most training algorithms, and in some ...

Automatic Speech Recognition (ASR), as the assistance of speech communication between pilots and air-traffic controllers, can significantly reduce the complexity of the task and increase the reliability of transmitted information. ASR application can lead ...

The conjugate heat transfer in mixtures of a fluid and single granular clusters is studied in this paper using a novel lattice Boltzmann method (LBM) programmed for parallel computation on the graphics processing unit (GPU). The LBM is validated for heat c ...

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

Memory Efficient Max Flow for Multi-Label Submodular MRFs

Chattez avec Graph Search

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

A 3.3-Gb/s SPAD-Based Quantum Random Number Generator

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Why is the winner the best?

Automating the Design of Programmable Interconnect for Reconfigurable Architectures

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

Tensile and creep-rupture response of additively manufactured nickel-based superalloy CM247LC

Results on Sparse Integer Programming and Geometric Independent Sets

How to Match in Modern Computational Settings

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles

A Study on Gradient-based Meta-learning for Robust Deep Digital Twins

Symbolic Algorithms for Token Swapping

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Estimation of discrete choice models with hybrid stochastic adaptive batch size algorithms

Automatic and high-precision microseismic monitoring of progressive failure prior, during, and after tunnel excavation

Local approximation of the Maximum Cut in regular graphs

Convergence without Convexity: Sampling, Optimization, and Games

A Two-Step Approach To Leverage Contextual Data: Speech Recognition In Air-Traffic Communications

Conjugate heat transfer in isolated granular clusters with interstitial fluid using lattice Boltzmann method

New Results in Integer and Lattice Programming