NoRSE: noise reduction and state evaluator for high-frequency single event traces
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.
Many modern services need to routinely perform tasks on a large scale. This prompts us to consider the following question:How can we design efficient algorithms for large-scale computation?In this thesis, we focus on devising a general strategy to addr ...
Under certain conditions, the ionization of a molecule may create a superposition of electronic states, leading to ultrafast electron dynamics. If controlled, this motion could be used in attochemistry applications, but it has been shown that the decoheren ...
Finding cycles in directed graphs enables important applications in various domains such as finance, biology, chemistry, and network science. However, as the size of graph datasets continues to grow, it becomes increasingly difficult to discover cycles wit ...
The problem of learning graphons has attracted considerable attention across several scientific communities, with significant progress over the re-cent years in sparser regimes. Yet, the current techniques still require diverg-ing degrees in order to succe ...
INST MATHEMATICAL STATISTICS-IMS2023
, , ,
In the first part of this two-part paper we show that the branch-flow convexification of the OPF problem is not exact and that the ADMM-based decomposition of the OPF fails to converge in specific scenarios. Therefore, there is a need to develop algorithms ...
Elsevier2017
In Urban Air Mobility (UAM) networks, takeoff and landing sites, called vertiports, are likely to experience intermittent closures due to, e.g., adverse weather. For safety, it will be required that all in-transit Urban Air Vehicles (UAVs) in a UAM network ...
In this paper, we study the data exchange problem, where a set of users is interested in gaining access to a common file, but where each has only partial knowledge about it as side-information. Assuming that the file is broken into packets, the side-inform ...
Institute of Electrical and Electronics Engineers2016
The security of public-key cryptography relies on well-studied hard problems, problems for which we do not have efficient algorithms. Factorization and discrete logarithm are the two most known and used hard problems. Unfortunately, they can be easily solv ...
In this paper we present a new reduced basis technique for parametrized nonlinear scalar conservation laws in presence of shocks. The essential ingredients are an efficient algorithm to approximate the shock curve, a procedure to detect the smooth componen ...
The performance of evolutionary algorithms can be heavily undermined when constraints limit the feasible areas of the search space. For instance, while Covariance Matrix Adapta- tion Evolution Strategy is one of the most efficient algorithms for unconstrai ...
Institute of Electrical and Electronics Engineers2016
