Concept

Chaîne de caractères

Publications associées (40)

Matchertext: Towards Verbatim Interlanguage Embedding

Embedding text in one language within text of another is commonplace for numerous purposes, but usually requires tedious and error-prone “escaping” transformations on the embedded string. We propose a simple cross-language syntactic discipline, matchertext ...

2022

The DCU-EPFL Enhanced Dependency Parser at the IWPT 2021 Shared Task

James Henderson, Alireza Mohammadshahi

We describe the DCU-EPFL submission to the IWPT 2021 Parsing Shared Task: From Raw Text to Enhanced Universal Dependencies. The task involves parsing Enhanced UD graphs, which are an extension of the basic dependency trees designed to be more facilitative ...

ASSOC COMPUTATIONAL LINGUISTICS-ACL2021

How Many CPU Cores is an FPGA Worth? Lessons Learned from Accelerating String Sorting on a CPU-FPGA System

Paolo Ienne, Mikhail Asiatici, Damian Maiorano

String sorting is a fundamental kernel of string matching and database index construction; yet, it has not been studied as extensively as fixed-length keys sorting. Because processing variable-length keys in hardware is challenging, it is no surprise that ...

SPRINGER2021

Out-of-equilibrium phase diagram of long-range superconductors

Within the ultimate goal of classifying universality in quantum many-body dynamics, understanding the relation between out-of-equilibrium and equilibrium criticality is a crucial objective. Models with power-law interactions exhibit rich well-understood cr ...

2020

Fractal-like Mechanical Resonators with a Soft-Clamped Fundamental Mode

Tobias Kippenberg, Alberto Beccari, Nils Johan Engelsen, Sergey Fedorov

Self-similar structures occur naturally and have been employed to engineer exotic physical properties. We show that acoustic modes of a fractal-like system of tensioned strings can display increased mechanical quality factors due to the enhancement of diss ...

AMER PHYSICAL SOC2020

Asymptotic decoupling and weak Gibbs measures for finite alphabet shift spaces

For the spaceXin a large class of finite alphabet shift spaces (lattice models) and the class of functionsfwith bounded total oscillations, we prove that each equilibrium measure nu atf=phi is a weak Gibbs measures for phi-P(phi). In addition, the empirica ...

2020

FPGAs in the Datacenters: the Case of Parallel Hybrid Super Scalar String Sample Sort

Paolo Ienne, Mikhail Asiatici, Damian Maiorano

String sorting is an important part of database and MapReduce applications; however, it has not been studied as extensively as sorting of fixed-length keys. Handling variable-length keys in hardware is challenging and it is no surprise that no string sorte ...

IEEE COMPUTER SOC2020

String Matching: Communication, Circuits, and Learning

Mika Tapani Göös

String matching is the problem of deciding whether a given n-bit string contains a given k-bit pattern. We study the complexity of this problem in three settings. - Communication complexity. For small k, we provide near-optimal upper and lower bounds on th ...

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany2019

Guessing the Fingerings

Samuel Pierre Rey

Some strings instruments, such as guitar or violin, can play the same note using different fingerings. To find out which string has been used, we developed an algorithm that compute the inharmonicity of a given audio sample, and then use it to identify the ...

2018

Reliability of photovoltaic modules

Eleonora Annigoni

A fundamental challenge with solar energy is improving the reliability, and increasing the lifetime, of photovoltaic modules. Typically, photovoltaic module manufacturers guarantee 80% of the nominal power of their modules for 25 years, but this type of gu ...

EPFL2018

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search