Publications associées à Récursivité

BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications

We give a construction of an efficient one-out-of-many proof system, in which a prover shows that he knows the pre-image for one element in a set, based on the hardness of lattice problems. The construction employs the recent zero-knowledge framework of Ly ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Coxeter Combinatorics For Sum Formulas In The Representation Theory Of Algebraic Groups

Jonathan Gruber

Let G be a simple algebraic group over an algebraically closed field F of characteristic p >= h, the Coxeter number of G. We observe an easy 'recursion formula' for computing the Jantzen sum formula of a Weyl module with p-regular highest weight. We also d ...

AMER MATHEMATICAL SOC2022

Self-induced thermo-optical effects in silicon and germanium dielectric nanoresonators

Giulia Tagliabue, Theodoros Tsoulos

Dielectric nanoresona tors uniquely support both magnetic and electric resonances across a wide wavelength range. They are thus being exploited in a growing number of groundbreaking applications. In particular, they have been recently suggested as promisin ...

2020

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

Recursive Non-Autoregressive Graph-to-Graph Transformer for Dependency Parsing with Iterative Refinement

James Henderson, Alireza Mohammadshahi

We propose the Recursive Non-autoregressive Graph-to-graph Transformer architecture (RNG-Tr) for the iterative refinement of arbitrary graphs through the recursive application of a non-autoregressive Graph-to-Graph Transformer and apply it to syntactic dep ...

2021

Displacement Convexity in Spatially Coupled Scalar Recursions

Rüdiger Urbanke, Nicolas Macris, Rafah El-Khatib

We introduce a technique for the analysis of general spatially coupled systems that are governed by scalar recursions. Such systems can be expressed in variational form in terms of a potential function. We show, under mild conditions, that the potential fu ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Verified Functional Programming

Nicolas Charles Yves Voirol

In this thesis, we present Stainless, a verification system for an expressive subset of the Scala language. Our system is based on a dependently-typed language and an algorithmic type checking procedure which ensures total correctness. We rely on SMT solve ...

EPFL2019

Dynamic Credit-Collections Optimization

Thomas Alois Weber

Based on a dynamic model of the stochastic repayment behavior exhibited by delinquent credit-card accounts as a self-exciting point process, a bank can control the arrival intensity of repayments using costly account-treatment actions. A semi-analytic solu ...

2019

Ontology for SEAM Service Models

Alain Wegmann, Gorica Tapandjieva Sekulovska

A service system is a popular concept in academia and industry. At the same time, it is a challenging concept to represent, due to its recursive nature and difficulty to relate it to entities in reality. In this paper we present an ontology for modeling se ...

2018

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Viktor Kuncak, Mikaël Mayer, Jad Hamza

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...

2017