Publication

Sensitivity of two-dimensional spectra

Related publications (177)

EPFL Library Research Data Management Fastguides

Francesco Varrato, Antoine Louis Claude Masson, Eliane Ninfa Blumer, Sitthida Samath, Fantin Reichler, Jérôme Julien Chaptinel

This is a set of 11 1-sheet guides, providing abridged notions, advice and references for quick and practical research data management: #01 Research Data: the basics #02 FAIR Data Principles #03 Cost of Research Data Management #04 File Formats #05 Metadat ...
2019

On the Hardness of the Strongly Dependent Decision Problem

Martin Biely

We present necessary and sufficient conditions for solving the strongly dependent decision (SDD) problem in various distributed systems. Our main contribution is a novel characterization of the SDD problem based on point-set topology. For partially synchro ...
ASSOC COMPUTING MACHINERY2019

A lower bound on opaque sets

János Pach

It is proved that the total length of any set of countably many rectifiable curves whose union meets all straight lines that intersect the unit square U is at least 2.00002. This is the first improvement on the lower bound of 2 known since 1964. A similar ...
ELSEVIER SCIENCE BV2019

Formal Approaches to Querying Big Data in Shared-Nothing Systems

Bas Ketsman

To meet today's data management needs, it is a widespread practice to use distributed data storage and processing systems. Since the publication of the MapReduce paradigm, a plethora of such systems arose, but although widespread, the capabilities of these ...
ASSOC COMPUTING MACHINERY2019

Bretherton's buoyant bubble

John Martin Kolinski, Wassim Dhaouadi

When a buoyant bubble is inserted into a closed capillary that is slightly smaller than the capillary length, it appears stuck; exactly why this is so is a puzzle that has remained unanswered over the past 50 years. Recent calculations suggest that the bub ...
2019

A proof of a sumset conjecture of Erdős

Florian Karl Richter

In this paper we show that every set A ⊂ ℕ with positive density contains B + C for some pair B, C of infinite subsets of ℕ , settling a conjecture of Erdős. The proof features two different decompositions of an arbitrary bounded sequence into a structured ...
2019

Cross-sections of line configurations in R-3 and (d-2)-flat configurations in R-d

Andres Jacinto Ruiz Vargas

We consider sets L = {l(1),..., l(n)} of n labeled lines in general position in R-3, and study the order types of point sets {p(1),..., p(n)} that stem from the intersections of the lines in L with (directed) planes Pi, not parallel to any line of L, that ...
ELSEVIER SCIENCE BV2019

Les "vestiges" de l'opération Million dans l'oeuvre de Georges Candilis - Actualités et stratégies de sauvegarde pour un patrimoine de l'habitat économique du second après-guerre

Korinna Zinovia Weber

The preservation of post-war architecture represents a complex challenge to overcome for different reasons: hesitating recognition, bad perception and a certain material fragility. Especially the economic post-war housing has difficulties to be recognized ...
EPFL2019

A machine learning approach based on generative topographic mapping for disruption prevention and avoidance at JET

Alessandro Pau

The need for predictive capabilities greater than 95% with very limited false alarms are demanding requirements for reliable disruption prediction systems in tokamaks such as JET or, in the near future, ITER. The prediction of an upcoming disruption must b ...
2019

Joint Segmentation and Path Classification of Curvilinear Structures

Pascal Fua, Agata Justyna Mosinska, Mateusz Kozinski

Detection of curvilinear structures in images has long been of interest. One of the most challenging aspects of this problem is inferring the graph representation of the curvilinear network. Most existing delineation approaches first perform binary segment ...
2019

Graph Chatbot

Chat with Graph Search

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.