Publication
How to Find Molecules with Long-lasting Charge Migration?
Publications associées (34)
Learning Sparse Graphons And The Generalized Kesten-Stigum Threshold
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-IMS2023Search for long-lasting electronic coherence using on-the-fly ab initio semiclassical dynamics
Jiri Vanicek, Alan Scheidegger, Nikolay Golubev
Using a combination of high-level ab initio electronic structure methods with efficient on-the-fly semiclassical evaluation of nuclear dynamics, we performed a massive scan of small polyatomic molecules searching for a long-lasting oscillatory dynamics of ...
AIP Publishing2022Safety Verification for Urban Air Mobility Scheduling
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 ...
ELSEVIER2022When Stuck, Flip a Coin
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 ...
EPFL2018Jump-Penalized Least Absolute Values Estimation of Scalar or Circle-Valued Signals
Michaël Unser, Martin Kurt Storath
We study jump-penalized estimators based on least absolute deviations which are often referred to as Potts estimators. They are estimators for a parsimonious piecewise constant representation of noisy data having a noise distribution which has heavier tail ...
Oxford University Press2017Scalable greedy algorithms for transfer learning
Barbara Caputo, Ilja Kuzborskij
In this paper we consider the binary transfer learning problem, focusing on how to select and combine sources from a large pool to yield a good performance on a target task. Constraining our scenario to real world, we do not assume the direct access to the ...
2017Efficient Algorithms for the Data Exchange Problem
Michael Christoph Gastpar, Sameer Pawar
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 Engineers2016Reduced Basis Techniques For Nonlinear Conservation Laws
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 ...
EDP Sciences2015MATHICSE Technical Report : Accelerated filtering on graphs using Lanczos method
Pierre Vandergheynst, Daniel Kressner, Nathanaël Perraudin, Ana Susnjara
Sinal-processing on graphs has developed into a very active field of research during the last decade. In particular, the number of applications using frames con-structed from graphs, like wavelets on graphs, has substantially increased. To attain scalabili ...
MATHICSE2015Near-Optimally Teaching the Crowd to Classify 
Andreas Krause, Amin Karbasi, Ilija Bogunovic
How should we present training examples to learners to teach them classification rules? This is a natural problem when training workers for crowdsourcing labeling tasks, and is also moti- vated by challenges in data-driven online educa- tion. We propose a ...
2014