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.
Regenerative Architecture is a conscious practice that seeks to create projects that benefit all impacted spheres, whether environmental, social or technical. The main aim is to have a qualitative and positive impact on the environment while bringing all u ...
We show that computing the majority of n copies of a boolean function g has randomised query complexity R(Maj∘gⁿ) = Θ(n⋅R ̅_{1/n}(g)). In fact, we show that to obtain a similar result for any composed function f∘gⁿ, it suffices to prove a sufficiently stro ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021
Neural networks (NNs) have been very successful in a variety of tasks ranging from machine translation to image classification. Despite their success, the reasons for their performance are still not well-understood. This thesis explores two main themes: lo ...
The evaluation of small degree polynomials is critical for the computation of elementary functions. It has been extensively studied and is well documented. In this article, we evaluate existing methods for polynomial evaluation on superscalar architecture. ...
Suppose we have randomized decision trees for an outer function f and an inner function g. The natural approach for obtaining a randomized decision tree for the composed function (f∘ gⁿ)(x¹,…,xⁿ) = f(g(x¹),…,g(xⁿ)) involves amplifying the success probabili ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2020
The randomized query complexity 𝖱(f) of a boolean function f: {0,1}ⁿ → {0,1} is famously characterized (via Yao’s minimax) by the least number of queries needed to distinguish a distribution 𝒟₀ over 0-inputs from a distribution 𝒟₁ over 1-inputs, maximized ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2020
Glycans play a pivotal role in both physiological processes; however, the field of glycobiology remains relatively understudied within biochemistry. The intricate complexity of glycans, coupled with their abundance of isomeric forms, presents formidable ch ...
Since the first animal antimicrobial peptides (AMPs) were discovered in insects, Drosophila melanogaster has emerged as a powerful model for their characterization. Drosophila AMPs have been used extensively to monitor the activity of the Toll and Imd NF-κ ...
The spectral sensitivity of the average human eye in photopic conditions is represented by the photopic luminosity function V (λ). The CIE has established the photopic luminosity functions for the 2o and 10o visual fields for a standard observer applicable ...
We propose and compare add-drop multiplexing schemes for Nyquist OTDM signals based on 1 x2 or 2 x2 Mach-Zehnder modulator. Bright and dark sinc pulse carver simultaneously provided by the modulator fulfil drop, notch and add functions. ...