Concept

Regular grammar

Related publications (32)

Enhancing Procedural Writing Through Personalized Example Retrieval: A Case Study on Cooking Recipes

Antoine Bosselut, Jibril Albachir Frej, Paola Mejia Domenzain, Luca Mouchel, Tatjana Nazaretsky, Seyed Parsa Neshaei, Thiemo Wambsganss

Writing high-quality procedural texts is a challenging task for many learners. While example-based learning has shown promise as a feedback approach, a limitation arises when all learners receive the same content without considering their individual input ...

2024

From C/C plus plus Code to High-Performance Dataflow Circuits

Paolo Ienne, Andrea Guerrieri, Lana Josipovic

High-level synthesis (HLS) tools typically generate statically scheduled datapaths. Static scheduling implies that the resulting circuits have a hard time exploiting parallelism in code with potential memory dependences, with control dependences, or where ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

An unrefinement algorithm for planar THB-spline parameterizations

Annalisa Buffa

Unrefinement is a tool that allows to perform faster numerical simulations by controlling the level of precision in the specified area. We introduce an algorithm that creates a coarser geometry from an initial regular geometry, which is represented with re ...

ELSEVIER2022

LHC Schottky Spectrum from Macro-Particle Simulations

Tatiana Pieloni, Nicolas Frank Mounet, Christophe Emmanuel R. Lannoy

We introduce a method for building Schottky spectra from macro-particle simulations performed with the PyHEADTAIL code, applied to LHC beam conditions. In this case, the use of a standard Fast Fourier Transform (FFT) algorithm to recover the spectral conte ...

JACoW Publishing2022

Free Boundary Regularity for Almost Every Solution to the Signorini Problem

Xavier Fernandez-Real Girona

We investigate the regularity of the free boundary for the Signorini problem in Rn+1. It is known that regular points are (n−1)-dimensional and C∞. However, even for C∞ obstacles φ, the set of non-regular (or degenerate) points could be very large—e.g. wit ...

2021

Grammar-based generation of bar networks in static equilibrium with bounded bar lengths

Corentin Jean Dominique Fivet, Ioannis Mirtsopoulos

This paper presents a generative approach for the conceptual design of structures, which aims at exploring alternative bar networks in static equilibrium by means of a grammar rule. Operating on incomplete networks of bars in interim static equilibrium, th ...

2021

Capture zone models of a multi-well system in aquifers bounded with regular and irregular inflow boundaries

David Andrew Barry, Setareh Nagheli

Being bounded by hydrological (inflow and barrier) boundaries, natural aquifers have regular/irregular shapes. Here, we consider aquifers bounded by segmental inflow (variable head) boundaries in which water is extracted/injected by a multi-well system. St ...

2020

Building blocks for commodity augmented reality-based molecular visualization and modeling in web browsers

Luciano Andres Abriata

For years, immersive interfaces using virtual and augmented reality (AR) for molecular visualization and modeling have promised a revolution in the way how we teach, learn, communicate and work in chemistry, structural biology and related areas. However, m ...

2020

Local Approximation of the Maximum Cut in Regular Graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

A logarithmic epiperimetric inequality for the obstacle problem

Maria Colombo

We study the regularity of the regular and of the singular set of the obstacle problem in any dimension. Our approach is related to the epiperimetric inequality of Weiss (Invent Math 138:23-50, Wei99a), which works at regular points and provides an alterna ...

2018

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.