Publications related to Detecting the Origin of Text Segments Efficiently

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

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

2024

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

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

EPFL2023

On Polynomial Algorithms for Normalizing Formulas

Viktor Kuncak, Simon Guilloud, Mario Bucev

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

2022

Model order reduction of flow based on a modular geometrical approximation of blood vessels

Simone Deparis, Luca Pegolotti

We are interested in a reduced order method for the efficient simulation of blood flow in arteries. The blood dynamics is modeled by means of the incompressible Navier–Stokes equations. Our algorithm is based on an approximated domain-decomposition of the ...

2021

Toward a remote assessment of walking bout and speed: application in patients with multiple sclerosis

Kamiar Aminian, Farzin Dadashi, Benoît Mariani, Arash Atrsaei

Gait speed as a powerful biomarker of mobility is mostly assessed in controlled environments, e.g. in the clinic. With wearable inertial sensors, gait speed can be estimated in an objective manner. However, most of the previous works have validated the gai ...

2021

Symbolic Algorithms for Token Swapping

Giovanni De Micheli, Mathias Soeken, Bruno Schmitt Antunes

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

2020

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

Maryam Kamgarpour, Tyler Summers, Baiwei Guo, Orcun Karaca

Actuator placement is an active field of research which has received significant attention for its applications in complex dynamical networks. In this paper, we study the problem of finding a set of actuator placements minimizing the metric that measures t ...

2020

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

Linearly Convergent Frank-Wolfe with Backtracking Line-Search

Martin Jaggi

Structured constraints in Machine Learning have recently brought the Frank-Wolfe (FW) family of algorithms back into the spotlight. While the classical FW algorithm has poor local convergence properties, Away-steps FW and Pairwise FW have emerged as improv ...

ADDISON-WESLEY PUBL CO2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

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

EPFL2020

Detecting the Origin of Text Segments Efficiently

Graph Chatbot

Chat with Graph Search

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

Results on Sparse Integer Programming and Geometric Independent Sets

On Polynomial Algorithms for Normalizing Formulas

Model order reduction of flow based on a modular geometrical approximation of blood vessels

Toward a remote assessment of walking bout and speed: application in patients with multiple sclerosis

Symbolic Algorithms for Token Swapping

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Linearly Convergent Frank-Wolfe with Backtracking Line-Search

New Results in Integer and Lattice Programming

Symbolic Algorithms for Token Swapping

Results on Sparse Integer Programming and Geometric Independent Sets

On Polynomial Algorithms for Normalizing Formulas

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

Toward a remote assessment of walking bout and speed: application in patients with multiple sclerosis

Model order reduction of flow based on a modular geometrical approximation of blood vessels

New Results in Integer and Lattice Programming

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Linearly Convergent Frank-Wolfe with Backtracking Line-Search