Concept

Algorithme de parcours en profondeur

Publications associées (52)

The (h, k)-Server Problem on Bounded Depth Trees

We study the k-server problem in the resource augmentation setting, i.e., when the performance of the online algorithm with k servers is compared to the offline optimal solution with h

ASSOC COMPUTING MACHINERY2019

The planning support system URBio is demonstrated via two case studies. Both case studies are located in the canton of Geneva. The first case study is a greenfield planning project, where the goal is to build a new district on former agricultural land. The ...

Academic Press2019

Despite well-established baselines, learning of scene depth and ego-motion from monocular video remains an ongoing challenge, specifically when handling scaling ambiguity issues and depth inconsistencies in image sequences. Much prior work uses either a su ...

IEEE COMPUTER SOC2019

We present an exact approach to synthesize temporal-logic formulas in linear temporal logic (LTL) from a set of given positive and negative example traces. Our approach uses topology structures, in particular partial DAGs, to partition the search space int ...

IEEE2019

, ,

This paper presents elastic transactions, an appealing alternative to traditional transactions, in particular to implement search structures in shared memory multicore architectures. Upon conflict detection, an elastic transaction might drop what it did so ...

Academic Press Inc Elsevier Science2017

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

Exploring Citation Networks to Study Intertextuality in Classics

Matteo Romanello

Referring constitutes such an essential scholarly activity across disciplines that it has been regarded by [Unsworth 2000] as one of the scholarly primitives. In Classics, in particular, the references to passages of the ancient texts - the so-called canon ...

Alliance Digital Humanities Organizations2016

BluePyOpt: Leveraging Open Source Software and Cloud Infrastructure to Optimise Model Parameters in Neuroscience

Henry Markram, Eilif Benjamin Muller, Werner Alfons Hilda Van Geit, Jean-Denis Georges Emile Courcol, Michael Emiel Gevaert, Idan Segev, Giuseppe Chindemi

At many scales in neuroscience, appropriate mathematical models take the form of complex dynamical systems. Parametrising such models to conform to the multitude of available experimental constraints is a global nonlinear optimisation problem with a comple ...

Frontiers Research Foundation2016

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

Rachid Guerraoui, Tudor Alexandru David

We argue that there is virtually no practical situation in which one should seek a "theoretically wait-free" algorithm at the expense of a state-of-the-art blocking algorithm in the case of search data structures: blocking algorithms are simple, fast, and ...

ACM2016

Systematic Reduction of Genome Scale Metabolic Reconstructions - redGEM

Vassily Hatzimanikatis, Meriç Ataman, Georgios Fengos, Keng Cher Soh, Daniel Federico Hernandez Gardiol

Genome-scale metabolic reconstructions (GEMs) are valuable resources for understanding and redesigning cellular networks as they encapsulate all the known biochemistry of the organisms from genes to proteins to their functions. Complexity of these large me ...

2015

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

We consider

L ^{ 1 }

SIAM2016