Publications related to Snakes With an Ellipse-Reproducing Property

Related publications (46)

Graph sparsification, sketching and adaptivity

Many challenges of modern graph processing stem from the fact that graphs have become massive and change frequently. Numerous techniques have been developed to address those issues, with graph cut sparsification offering to replace original graphs with th ...

EPFL2025

The Cost of Consistency: Submodular Maximization with Constant Recourse

Ola Nils Anders Svensson

In this work, we study online submodular maximization and how the requirement of maintaining a stable solution impacts the approximation. In particular, we seek bounds on the best-possible approximation ratio that is attainable when the algorithm is allowe ...

ACM2025

Principles and Guidelines for Evaluating Social RobotNavigation Algorithms

Alexandre Massoud Alahi

A major challenge to deploying robots widely is navigation in human-populated environments, commonly referred to as social robot navigation. While the field of social navigation has advanced tremendously in recent years, the fair evaluation of algorithms t ...

ASSOC COMPUTING MACHINERY2025

Solving the Tensor Isomorphism Problem for Special Orbits with Low Rank Points: Cryptanalysis and Repair of an Asiacrypt 2023 Commitment Scheme

Laurane Chloé Angélina Marco

The Tensor Isomorphism Problem (TIP) has been shown equivalent to the matrix code equivalence problem, making it an interesting candidate on which to build post-quantum cryptographic primitives. These hard problems have already been used in protocol develo ...

Springer Cham2024

On the conjugate symmetry and sparsity of the harmonic decomposition of parametric surfaces with the randomised Kaczmarz method

Katrin Beyer

This limitation is circumvented by using scalable and non–memory–intensive harmonic expansions. In this paper, the projection of parametric surfaces onto disk and spherical harmonics bases is investigated, and three novel computationally efficient algorith ...

2024

Energy-Aware Decentralized Learning with Intermittent Model Training

Anne-Marie Kermarrec, Rafael Pereira Pires, Rishi Sharma, Marinus Abraham de Vos, Akash Balasaheb Dhasade

SKIPTRAIN is a novel Decentralized Learning (DL) algorithm, which minimizes energy consumption in decentralized learning by strategically skipping some training rounds and substituting them with synchronization rounds. These trainingsilent periods, besides ...

IEEE2024

Advanced control strategies to exploit the hydropower potential enhancing ancillary services provision to the power system

Francesco Gerini

The European Union's Green Deal aims for a 55% reduction in greenhouse gas emissions by 2030. To reach this goal, a massive integration of Renewable Energy Sources (RES) into the power grid is necessary. As RES become a large part of the electricity genera ...

EPFL2024

Retraction-based numerical methods for continuation, interpolation and time integration on manifolds

Axel Elie Joseph Séguin

The goal of this thesis is the development and the analysis of numerical methods for problems where the unknown is a curve on a smooth manifold. In particular, the thesis is structured around the three following problems: homotopy continuation, curve inter ...

EPFL2023

Quantization for Decentralized Learning Under Subspace Constraints

Ali H. Sayed, Stefan Vlaski, Roula Nassif

In this article, we consider decentralized optimization problems where agents have individual cost functions to minimize subject to subspace constraints that require the minimizers across the network to lie in low-dimensional subspaces. This constrained fo ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Distributed Shadow Dynamic Consensus Optimization Framework for Power Market with Parameterization Bidding Strategy of GENCOs

Liying Yu, Sidi-Rachid Cherkaoui

This paper presents a distributed shadow dynamic consensus (DSDC) framework to address the generation company (GENCO) strategic bidding problem in the independent system operator (ISO) operation. First, each sub-group is defined according to the communicat ...

IEEE2023

New SIDH Countermeasures for a More Efficient Key Exchange

Tako Boris Fouotsa

The Supersingular Isogeny Diffie-Hellman (SIDH) protocol has been the main and most efficient isogeny-based encryption protocol, until a series of breakthroughs led to a polynomial-time key-recovery attack. While some countermeasures have been proposed, th ...

Springer2023

Maximum Independent Set: Self-Training through Dynamic Programming

Volkan Cevher, Grigorios Chrysos, Efstratios Panteleimon Skoulakis

This work presents a graph neural network (GNN) framework for solving the maximum independent set (MIS) problem, inspired by dynamic programming (DP). Specifically, given a graph, we propose a DP-like recursive algorithm based on GNNs that firstly construc ...

2023

Computational parametric analysis of the design of cross-flow turbines under constraints

François Avellan, Sebastián Camilo Leguizamón Sarmiento

The cross-flow turbine is an attractive technology for small-scale hydropower generation thanks to its low capital cost and relatively high efficiency even under partial discharge operating conditions. It has been proposed that this kind of turbine can be ...

Pergamon-Elsevier Science Ltd2020

Scale limitations of gas bearing supported turbocompressors for vapor compression cycles

Jürg Alexander Schiffmann

An analysis of single-stage centrifugal compressors supported on dynamic, gas lubricated bearings for driving vapor compression cycles suggests that the maximum feasible compressor power is limited, primarily by the bearing load capacity, in the range from ...

2020

Online Network Source Optimization with Graph-Kernel MAB

Pascal Frossard

We propose Grab-UCB, a graph-kernelmulti-arms bandit algorithm to learn online the optimal source placement in large scale networks, such that the reward obtained from a priori unknown network processes is maximized. The uncertainty calls for online learni ...

Springer International Publishing Ag2023

Modeling and Optimization of Ridesplitting Operations

Caio Vitor Beojone

Ridesourcing has driven a lot of attention in recent years with the expansion of companies like Uber, Lift, and many others around the world. Companies use mobile applications connected through the internet to match drivers and their passengers real-time. ...

EPFL2023

Algorithms for Efficient and Robust Distributed Deep Learning

Tao Lin

The success of deep learning may be attributed in large part to remarkable growth in the size and complexity of deep neural networks. However, present learning systems raise significant efficiency concerns and privacy: (1) currently, training systems are l ...

EPFL2022

Many touchings force many crossings

János Pach

Given n continuous open curves in the plane, we say that a pair is touching if they have finitely many interior points in common and at these points the first curve does not get from one side of the second curve to its other side. Otherwise, if the two cur ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2019

Three Problems of Liquidity under Asymmetric Information

Sylvain Jean Pascal Carré

This thesis develops models for three problems of liquidity under asymmetric information. In the chapter "Disclosures, Rollover Risk, and Debt Runs" I build a model of dynamic debt runs without perfect information in order to understand the impact of asset ...

EPFL2019

Mathematical Foundations of Adaptive Isogeometric Analysis

Annalisa Buffa, Rafael Vazquez Hernandez

This paper reviews the state of the art and discusses recent developments in the field of adaptive isogeometric analysis, with special focus on the mathematical theory. This includes an overview of available spline technologies for the local resolution of ...

SPRINGER2022