Concept

Selection algorithm

Related publications (108)

Augmented Memory: Sample-Efficient Generative Molecular Design with Reinforcement Learning

Sample efficiency is a fundamental challenge in de novo molecular design. Ideally, molecular generative models should learn to satisfy a desired objective under minimal calls to oracles (computational property predictors). This problem becomes more apparen ...

Amer Chemical Soc2024

Near-Zero Parasitic Shift Flexure Pivots Based on Coupled n-RRR Planar Parallel Mechanisms

Simon Nessim Henein, Florent Cosandier, Loïc Benoît Tissot-Daguette, Etienne Frédéric Gabriel Thalmann

Flexure pivots, which are widely used for precision mechanisms, generally have the drawback of presenting parasitic shifts accompanying their rotation. The known solutions for canceling these undesirable parasitic translations usually induce a loss in radi ...

2024

Optimal digital filter selection for remote photoplethysmography (rPPG) signal conditioning

Ata Jedari Golparvar

Remote photoplethysmography (rPPG) using camera-based imaging has shown excellent potential recently in vital signs monitoring due to its contactless nature. However, the optimum filter selection for pre-processing rPPG data in signal conditioning is still ...

IOP Publishing Ltd2023

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

Zero Parasitic Shift Pivoting Kinematic Structures Based On Coupled N-RRR Planar Parallel Mechanims For Flexure Pivot Design

Simon Nessim Henein, Florent Cosandier, Loïc Benoît Tissot-Daguette, Etienne Frédéric Gabriel Thalmann

ASME2023

Geometric Considerations in Lattice Programming

Moritz Andreas Venzin

We provide faster algorithms and fine-grained reductions for lattice problems in general norms. ...

EPFL2023

Fast deterministic and randomized algorithms for low-rank approximation, matrix functions, and trace estimation

Alice Cortinovis

In this thesis we propose and analyze algorithms for some numerical linear algebra tasks: finding low-rank approximations of matrices, computing matrix functions, and estimating the trace of matrices.In the first part, we consider algorithms for building l ...

EPFL2022

Exploration of Hyperdimensional Computing Strategies for Enhanced Learning on Epileptic Seizure Detection

David Atienza Alonso, Tomas Teijeiro Campo, Una Pale

Wearable and unobtrusive monitoring and prediction of epileptic seizures has the potential to significantly increase the life quality of patients, but is still an unreached goal due to challenges of real-time detection and wearable devices design. Hyperdim ...

2022

Efficient geometric integrators for the linear and nonlinear time-dependent Schrödinger equation

Julien Roulet

Many physical and chemical reactions are driven by nonadiabatic processes, which imply the breakdown of the celebrated Born-Oppenheimer approximation. To understand these processes, experimentalists employ spectroscopic techniques. However, the obtained re ...

EPFL2022

Development of a novel two-phase flow solver for nuclear reactor analysis: algorithms, verification and implementation in OpenFOAM

Andreas Pautz, Carlo Fiorina, Stefan Radman

A porous medium-based representation of nuclear reactors and complex engineering systems more in general can significantly reduce simulation and modelling costs, while preserving a reasonable degree of accuracy via regime map-based correlations for modelli ...

2021

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.