Publication

Efficient Algorithms for the Data Exchange Problem

Publications associées (96)

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

Sample efficiency is a fundamental challenge in de novo molecular design. Ideally, molecular generative models should learn to satisfy a desired objective under minimal calls to oracles (computational property predictors). This problem becomes more apparen ...

Amer Chemical Soc2024

Learning Sparse Graphons And The Generalized Kesten-Stigum Threshold

Emmanuel Abbé

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

Dataset for the evaluation of student-level outcomes of a primary school Computer Science curricular reform

Francesco Mondada, Barbara Bruno, Laila Abdelsalam El-Hamamsy

The associated peer reviewed article that will appear in the International Journal of STEM education : El-Hamamsy, L., Bruno, B., Audrin, C., Chevalier, M., Avry S., Dehler Zufferey, J., and Mondada, F. (2023). How are Primary School Computer Science Curri ...

EPFL Infoscience2023

, ,

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

SWISS CHEMICAL SOC2023

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

ELSEVIER2022

Cooperative Data Exchange and Private Information Retrieval

Su Li

Coding techniques have been well studied and used for improving communication quality by combating noise and mitigating interference. Recently, it has been shown that the same coding techniques can also be exploited to further improve communication perform ...

EPFL2020

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

Algebraic network information theory is an emerging facet of network information theory, studying the achievable rates of random code ensembles that have algebraic structure, such as random linear codes. A distinguishing feature is that linear combinations ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Converse for Multi-Server Single-Message PIR with Side Information

Michael Christoph Gastpar, Su Li

Multi-server single-message private information retrieval is studied in the presence of side information. In this problem, K independent messages are replicatively stored at N non-colluding servers. The user wants to privately download one message from the ...

2020

Distance to the nearest land/coastline (including small subantarctic islands) for the five-minute average cruise track of the Antarctic Circumnavigation Expedition (ACE) during the austral summer of 2016/2017.

Julia Schmale, Jenny Thomas, Sebastian Johannes Heinz-Josef Landwehr

Dataset abstract This dataset is derived from: - The GPS track of the R/V-Akademik Tryoshnikov (10.5281/zenodo.3772377) - The shapefiles of the continents from NaturalEarth physical (@50m), version 4.1.0, downloadable at [https ...

2020

New Graph Algorithms via Polyhedral Techniques

Jakub Tarnawski

In this thesis we give new algorithms for two fundamental graph problems. We develop novel ways of using linear programming formulations, even exponential-sized ones, to extract structure from problem instances and to guide algorithms in making progress. S ...

EPFL2019