For MSO$_2$-expressible problems like Edge Dominating Set or Hamiltonian Cycle, it was open for a long time whether there is an algorithm which given…

The appearance of an object is significantly affected by the illumination conditions in the environment. This is more evident with strong reflective …

Future 5G and Internet of Things (IoT) applications will heavily rely on long-range communication technologies such as low-power wireless area networ…

In this paper, we combine the rank-based approach with the notion of $d$-neighbor equivalence to obtain efficient algorithms for several connectivity…

In a context of autonomous robots, one of the most important task is to ensure the safety of the robot and its surrounding. Most of the time, the ris…

We present a cut-cell method for the simulation of 2D incompressible flows past obstacles. It consists in using the MAC scheme on cartesian grids and…

The repulsion between free electrons inside a metal makes its optical response spatially dispersive, so that it is not described by Drude's model but…

Recent experiments have shown that spatial dispersion may have a conspicuous impact on the response of plasmonic structures. This suggests that in so…

Recent experiments with film-coupled nanoparticles suggest that the impact of spatial dispersion is enhanced in plasmonic structures where high wavev…

We have proposed a reformulation of the Ising distribution as a latent variable model, and used it to derive a new approximation by the simpler Cox distribution. It shares the same perturbative expansion at order 2 as the TAP approximation from clas…

We show that the Ising distribution can be treated as a latent variable model, where a set of N real-valued, correlated random variables are drawn an…

A set $S \subset \mathbb{Z}^d$ is digital convex if $conv(S) \cap \mathbb{Z}^d = S$, where $conv(S)$ denotes the convex hull of $S$. In this paper, w…

In this paper, we proposed SAT encoding to address the problem of mining frequent gradual patterns. This declarative approach offers an additional possibility to benefit from the recent progress in satisfiability testing. Several satisfiability base…

In this paper, we propose a constraint-based modeling approach for the problem of discovering frequent gradual patterns in a numerical dataset. This …

We investigate two different approaches to enumerate minimal dominating sets of a graph using structural properties based on neighborhood inclusion. …

One important development in interaction potential models, or atomistic force fields, for molecular simulation is the inclusion of explicit polarisat…

Topological Physics relies on the specific structure of the eigenstates of Hamiltonians. Their geometry is encoded in the quantum geometric tensor co…

In the companion paper [Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm, Algorithmica 78(1):342--377, 2017], we presen…

During the past decades, the Ising distribution has attracted interest in many applied disciplines, as the maximum entropy distribution associated to…

To proceed further, we use a careful analysis of Mori’s proof of the above theorem to generalize Proposition 35. First we give the precise definition of a geometric algebra.

We address a natural question in noncommutative geometry, namely the rigidity observed in many examples, whereby noncommutative spaces (or equivalent…

The potato-peeling problem (also known as convex skull) is a fundamental computational geometry problem and the fastest algorithm to date runs in $O(…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account