Publications associées à Gracefully Degrading Fair Exchange with Security Modules

Hybrid Flock - Formation Control Algorithms

Alcherio Martinoli, Cyrill Silvan Baumann, Jonas Perolini, Emna Tourki

Two prominent categories for achieving coordinated multirobot displacement are flocking and navigation in formation. Both categories have their own body of literature and characteristics, including their respective advantages and disadvantages. While typic ...

Springer Nature Switzerland2022

Secured Routines: Language-based Construction of Trusted Execution Environments

Adrien Ghosn, Edouard Bugnion, James Richard Larus

Trusted Execution Environments (TEEs), such as Intel SGX enclaves, use hardware to ensure the confidentiality and integrity of operations on sensitive data. While the technology is available on many processors, the complexity of its programming model and i ...

USENIX ASSOC2019

Monogenic Filtering Based Automatic Defect Detection from a Single Fringe Pattern

Pramod Rastogi, Rishikesh Dilip Kulkarni

We propose a fringe analysis algorithm for the automatic detection of defects from a single fringe pattern (FP). Typically, the surface defects exhibit high fringe density areas in the FP. Consequently, high fringe density regions can be utilized as a sign ...

Springer2019

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

Volkan Cevher, Ilija Bogunovic, Slobodan Mitrovic, Ashkan Norouzi Fard, Jakub Tarnawski

We study the classical problem of maximizing a monotone submodular function subject to a cardinality constraint k, with two additional twists: (i) elements arrive in a streaming fashion and (ii) m items from the algorithm’s memory might be removed after th ...

2017

An integer programming approach to scheduling the transshipment of products at cross-docks in less-than-truckload industries

Mohammad Yousef Maknoon

This paper introduces an exact method to schedule the internal transshipment process at cross-docks in less-than-truckload industries. An integer programming formulation is presented to minimize the cost of double handling by synchronizing two types of dec ...

Pergamon-Elsevier Science Ltd2017

AC OPF in radial distribution networks – Part II: An augmented Lagrangian-based OPF algorithm, distributable via primal decomposition

Jean-Yves Le Boudec, Mario Paolone, Dan-Cristian Tomozei, Konstantina Christakou

In the first part of this two-part paper we show that the branch-flow convexification of the OPF problem is not exact and that the ADMM-based decomposition of the OPF fails to converge in specific scenarios. Therefore, there is a need to develop algorithms ...

Elsevier2017

A Distributed Algorithm for Partitioned Robust Submodular Maximization

Volkan Cevher, Ilija Bogunovic, Slobodan Mitrovic, Jonathan Mark Scarlett

In this paper, we consider the problem of maximizing a monotone submodular function subject to a cardinality constraint, with two added twists: The computation is distributed across a number of machines, and we require the solution to be robust against adv ...

2017

Target-based fiber assignment for large survey spectrographs

Laleh Makarem, Christoph Ernst René Schäfer, Jean-Paul Richard Kneib

Next generation massive spectroscopic survey projects have to process a massive amount of targets. The preparation of subsequent observations should be feasible in a reasonable amount of time. We present a fast algorithm for target assignment that scales a ...

Spie-Int Soc Optical Engineering2016

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Benjamin Stamm, Jan Sickmann Hesthaven

We propose two new and enhanced algorithms for greedy sampling of high- dimensional functions. While the techniques have a substantial degree of generality, we frame the discussion in the context of methods for empirical interpolation and the devel- opment ...

EDP Sciences2014

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

Springer Verlag2012

An Efficient Algorithm for Level Set Method Preserving Distance Function

Jean-Philippe Thiran, Xavier Bresson, Dominique Zosso, Virginia Estellers Casas

The level set method is a popular technique for tracking moving interfaces in several disciplines including computer vision and fluid dynamics. However, despite its high flexibility, the original level set method is limited by two important numerical issue ...

Institute of Electrical and Electronics Engineers2012

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Infinite integrals with the weighted averages algorithm

Juan Ramon Mosig, Athanasios Polymeridis

A new version of the weighted averages (WA) algorithm, called generalized WA, is introduced. Generalized WA exhibit a more compact formulation, devoid of iterative and recursive steps, and a wider range of applications. It is more robust, as it provides a ...

2011

Swift Algorithms for Repeated Consensus

André Schiper, Fatemeh Borran, Martin Hutle, Nuno Filipe de Sousa Santos

We introduce the notion of a swift algorithm. Informally, an algorithm that solves the repeated consensus is swift if, in a partial synchronous run of this algorithm, eventually no timeout expires, i.e., the algorithm execution proceeds with the actual spe ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2010

Geometry-aware analysis of high-dimensional visual information sets

Effrosyni Kokiopoulou

Over the past few decades we have been experiencing a data explosion; massive amounts of data are increasingly collected and multimedia databases, such as YouTube and Flickr, are rapidly expanding. At the same time rapid technological advancements in mobil ...

EPFL2009

Estimation of modelling errors in structural system identification

Ian Smith, James-Alexandre Goulet

This paper presents a method for measurement-system design through criteria related to model based structural identification. Using a multi-model approach and results from previous research carried out at EPFL, an improved algorithm is proposed. The algori ...

2009

Nonlinear Average Consensus

Martin Hasler, Leonidas Georgopoulos

We present an algorithm for nonlinear consensus in complex networks. Our motivation draws from analysis on the algorithm based on a weighted linear update protocol. Comparison of the asymptotic with early convergence rate encourages an alternative algorith ...

IEICE2009

Distributed Rate Allocation for Network-coded Systems

Christina Fragouli, Amin Jafarian

This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multic ...

2009

Distributed rate allocation for network-coded systems

Christina Fragouli, Amin Jafarian

This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multic ...

2009