Concept

Merge algorithm

Publications associées (45)

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

Paolo Ienne, Kubilay Atasu, Jovan Blanusa

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

New York2023

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

Paolo Ienne, Kubilay Atasu, Jovan Blanusa

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

arXiv2023

Recursive blocked algorithms for linear systems with Kronecker product structure

Daniel Kressner

Recursive blocked algorithms have proven to be highly efficient at the numerical solution of the Sylvester matrix equation and its generalizations. In this work, we show that these algorithms extend in a seamless fashion to higher-dimensional variants of g ...

SPRINGER2020

When illusions merge

Michael Herzog, Aline Françoise Cretenoud, Gregory Francis

We recently found only weak correlations between the susceptibility to various visual illusions. However, we observed strong correlations among different variants of an illusion, suggesting that the visual space of illusions includes several illusion-speci ...

2020

SAT-Sweeping Enhanced for Logic Synthesis

Giovanni De Micheli, Luca Gaetano Amarù, Eleonora Testa

SAT-sweeping is a powerful method for simplifying logic networks. It consists of merging gates that are proven equivalent (up to complementation) by running simulation and SAT solving in synergy. SAT-sweeping is used in both verification and synthesis appl ...

IEEE2020

SAT-Sweeping Enhanced for Logic Synthesis

Giovanni De Micheli, Luca Gaetano Amarù, Eleonora Testa

IEEE2020

Merging into Single-Lane Roundabouts in the Presence of Uncertainty

Denis Gillet, Ezequiel González Debada

Merging efficiently into roundabouts represents a challenge for autonomous vehicles due to the speed difference between merging traffic flows and the lack of certainty regarding drivers' intent, specially when the road is shared with human drivers and/or i ...

2019

Particle number control for direct simulation Monte-Carlo methodology using kernel estimates

The efficiency of stochastic particle schemes for large scale simulations relies on the ability to preserve a uniform distribution of particles in the whole physical domain. While simple particle split and merge algorithms have been considered previously, ...

2019

Batch Fabrication of Multilayer Polymer Cantilevers with Integrated Hard Tips for High-Speed Atomic Force Microscopy

Georg Fantner, Nahid Hosseini, Jonathan David Adams, Oliver Peric, Santiago Harald Andany, Matthias Neuenschwander

Increasing the speed of AFM imaging has significant benefits for academic research as well as industrial applications. In many imaging modes, the dynamic response of the cantilever probe dictates the achievable speed. Polymer cantilevers have gained great ...

IEEE2019

Mitigating the impact of selfish routing: An optimal-ratio control scheme (ORCS) inspired by autonomous driving

Kenan Zhang

Fully controllable autonomous vehicles offer unprecedented opportunities to address the inefficiency associated with selfish routing, a fundamental issue in transportation network modeling. This study proposes a route control scheme that aims to strike a b ...

2018

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search