Reconstructing Loopy Curvilinear Structures Using Integer Programming

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Integer linear programming (ILP) is an elegant approach to solve linear optimization problems, naturally described using integer decision variables. Within the context of physics-inspired machine learning (ML) applied to chemistry, we demonstrate the relev ...

A shortcut model is a low-order model that provides a simplified representation of a complex process, thereby enabling faster and more efficient analysis, design and optimization without the computational intensity of a full-scale model. For continuous dis ...

In this work, we develop first-order (Hessian-free) and zeroth-order (derivative-free) implementations of the Cubically Regularized Newton Method for solving general non-convex optimization problems. For that, we employ finite difference approximations of ...

We provide an exact deterministic reformulation for data-driven chance constrained programs over Wasserstein balls. For individual chance constraints as well as joint chance constraints with right-hand side uncertainty, our reformulation amounts to a mixed ...

We consider a network of agents that must solve an online optimization problem from continual observation of streaming data. To this end, the agents implement a distributed cooperative strategy where each agent is allowed to perform local exchange of infor ...

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

We formulate computed-tomography reconstruction as a continuous-domain optimization problem with Hessian total variation (HTV) as the regularizer. HTV is a sparsity-promoting regularizer that favors continuous and piecewise-linear functions with few affine ...

The present invention relates to a compound of the general formula (I), (II) and (III), more specifically of formula (Ia), (Ib), (Ic)wherein R11 and R12 or R21 and R22 or R31 and R32 are both hydrogen or form together with CHR50 a cyclic moiety or one of R ...

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 ...

This paper studies the problem of online performance optimization of constrained closed-loop control systems, where both the objective and the constraints are unknown black-box functions affected by exogenous time-varying contextual disturbances. A primal- ...

In this article, we consider decentralized optimization problems where agents have individual cost functions to minimize subject to subspace constraints that require the minimizers across the network to lie in low-dimensional subspaces. This constrained fo ...

Control systems operating in real-world environments often face disturbances arising from measurement noise and model mismatch. These factors can significantly impact the perfor- mance and safety of the system. In this thesis, we aim to leverage data to de ...

The decentralisation and unpredictability of new renewable energy sources require rethinking our energy system. Data-driven approaches, such as reinforcement learning (RL), have emerged as new control strategies for operating these systems, but they have n ...

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 ...

The progress towards intelligent systems and digitalization relies heavily on the use of automation technology. However, the growing diversity of control objects presents significant challenges for traditional control approaches, as they are highly depende ...

Photoplethysmography (PPG) is a widely emerging method to assess vascular health in humans. The origins of the signal of reflective PPG on peripheral arteries have not been thoroughly investigated. We aimed to identify and quantify the optical and biomecha ...

Compound of the general formula (Ia), (Ib) and (Ic) R50 and R60 are different form each other and are selected from the group consisting of -R70, -ZR70, -Z-OH, -Z-NH2, -Z-SH, -Z-OC(O)R70, -OC(O)R70, - COOH and its corresponding salts, -C(O)NH2, -C(O)NH-R70 ...

The finite element method is a well-established method for the numerical solution of partial differential equations (PDEs), both linear and nonlinear. However, the repeated re -assemblage of finite element matrices for nonlinear PDEs is frequently pointed ...

Graph sparsification has been studied extensively over the past two decades, culminating in spectral sparsifiers of optimal size (up to constant factors). Spectral hypergraph sparsification is a natural analogue of this problem, for which optimal bounds on ...

A system for measuring synchrony between two or more regions, or within a single region, of a subject's brain. The system can include a signal conditioning module in communication with a phase extraction module. The signal conditioning module can receive a ...

Reconstructing Loopy Curvilinear Structures Using Integer Programming

Chat with Graph Search

Integer Linear Programming for Unsupervised Training Set Selection in Molecular Machine Learning

A shortcut model for batch distillation columns using pertinent effective factors

First and Zeroth-Order Implementations of the Regularized Newton Method with Lazy Approximated Hessians

Data-Driven Chance Constrained Programs over Wasserstein Balls

Distributed Adaptive Learning Under Communication Constraints

A ride time-oriented scheduling algorithm for dial-a-ride problems

A Continuous-Domain Solution for Computed Tomography with Hessian Total-Variation Regularization

Biobased surfactant

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints

Quantization for Decentralized Learning Under Subspace Constraints

Data-Driven Control and Optimization under Noisy and Uncertain Conditions

Reinforcement Learning for Joint Design and Control of Battery-PV Systems

Results on Sparse Integer Programming and Geometric Independent Sets

Data-driven Methods for Control: from Linear to Lifting

Quantification of the Phenomena Affecting Reflective Arterial Photoplethysmography

Biobased surfactants

On the fast assemblage of finite element matrices with application to nonlinear heat transfer problems

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Systems and methods for energy-efficient measurement of neurophysiological oscillations