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.
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
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
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 ...
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 ...
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 ...