Publications related to Analyse I (partie 2) : Introduction aux nombres complexes

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.

Sparsely observed functional time series: estimation and prediction

Victor Panaretos, Tomas Rubin

Functional time series analysis, whether based on time or frequency domain methodology, has traditionally been carried out under the assumption of complete observation of the constituent series of curves, assumed stationary. Nevertheless, as is often the c ...

INST MATHEMATICAL STATISTICS2020

High gamma response tracks different syntactic structures in homophonous phrases

Silvestro Micera, Fiorenzo Artoni

Syntax is a species-specific component of human language combining a finite set of words in a potentially infinite number of sentences. Since words are by definition expressed by sound, factoring out syntactic information is normally impossible. Here, we c ...

NATURE PUBLISHING GROUP2020

TV-based reconstruction of periodic functions

Julien René Pierre Fageot, Matthieu Martin Jean-André Simeoni

We introduce a general framework for the reconstruction of periodic multivariate functions from finitely many and possibly noisy linear measurements. The reconstruction task is formulated as a penalized convex optimization problem, taking the form of a sum ...

IOP PUBLISHING LTD2020

The Cost of Scaling a Reliable Interconnection Topology

Rachid Guerraoui, Alexandre David Olivier Maurer

In distributed computing, many papers try to evaluate the message complexity of a distributed system as a function of the number of nodes n. But what about the cost of building the distributed system itself? Assuming that we want to reliably connect n node ...

2020

Mask Combination of Multi-Layer Graphs for Global Structure Inference

Pascal Frossard, Elif Vural, Eda Bayram

Structure inference is an important task for network data processing and analysis in data science. In recent years, quite a few approaches have been developed to learn the graph structure underlying a set of observations captured in a data space. Although ...

2020

Mechanical oscillator with tunable isochronism defect

Simon Nessim Henein, Mohammad Hussein Kahrobaiyan, Mohamed Gamal Abdelrahman Ahmed Zanaty

Mechanical oscillator (1) for a timepiece comprising an inertial mass (3) arranged to oscillate about a neutral position under the effect of a restoring force provided by at least one elastic element (5),characterised in that said mechanical oscillator (1) ...

2020

Differentially Private Release of Synthetic Graphs

Mikhail Kapralov, Marek Elias

We propose a (epsilon, delta)-differentially private mechanism that, given an input graph G with n vertices and m edges, in polynomial time generates a synthetic graph G' approximating all cuts of the input graph up to an additive error of O (root mn/epsil ...

ASSOC COMPUTING MACHINERY2020

Jamming with Tunable Roughness

Matthieu Wyart, Carolina Brito Carvalho dos Santos

We introduce a new model to study the effect of surface roughness on the jamming transition. By performing numerical simulations, we show that for a smooth surface, the jamming transition density and the contact number at the transition point both increase ...

AMER PHYSICAL SOC2020

Analyse I (partie 2) : Introduction aux nombres complexes

Graph Chatbot

Chat with Graph Search

Sparsely observed functional time series: estimation and prediction

High gamma response tracks different syntactic structures in homophonous phrases

TV-based reconstruction of periodic functions

The Cost of Scaling a Reliable Interconnection Topology

On the Experimental Transferability of Spectral Graph Convolutional Networks

Mask Combination of Multi-Layer Graphs for Global Structure Inference

Mechanical oscillator with tunable isochronism defect

Antennas for CubeSat Communication

Differentially Private Release of Synthetic Graphs

Jamming with Tunable Roughness

Sparsely observed functional time series: estimation and prediction

TV-based reconstruction of periodic functions

The Cost of Scaling a Reliable Interconnection Topology

Mechanical oscillator with tunable isochronism defect

Antennas for CubeSat Communication

High gamma response tracks different syntactic structures in homophonous phrases

On the Experimental Transferability of Spectral Graph Convolutional Networks

Differentially Private Release of Synthetic Graphs

Mask Combination of Multi-Layer Graphs for Global Structure Inference

Jamming with Tunable Roughness