Publication

Materials Cloud, a platform for open computational science

Related publications (69)

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.

Time-resolved analysis of dynamic graphs: an extended Slepian design

Dimitri Nestor Alice Van De Ville, Raphaël Pierre Liégeois, Ibrahim Merad

Graphs are extensively used to represent networked data. In many applications, especially when considering large datasets, it is a desirable feature to focus the analysis onto specific subgraphs of interest. Slepian theory and its extension to graphs allow ...

SPIE-INT SOC OPTICAL ENGINEERING2019

Cost Calculator for DMP

Antoine Louis Claude Masson

In recent years, funding agencies, governments, and international organization have issued a series of research data management and sharing policies, like the H2020 [1]. Researchers are encouraged or required to share their production in an open way, inclu ...

2019

Ethics in Research

Science is in revolution. The formidable scientific and technological developments of the last century have dramatically transformed the way in which we conduct scientific research. The knowledge and applications that science produces has profound conseque ...

2019

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Ola Nils Anders Svensson

A sparsifier of a graph G (Bencztir and Karger; Spielman and Teng) is a sparse weighted subgraph (G) over tilde that approximately retains the same cut structure of G. For general graphs, non-trivial sparsification is possible only by using weighted graphs ...

IEEE COMPUTER SOC2019

Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdős-Rényi Graphs

Matthias Grossglauser, Negar Kiyavash, Osman Emre Dai

Graph alignment in two correlated random graphs refers to the task of identifying the correspondence between vertex sets of the graphs. Recent results have characterized the exact information-theoretic threshold for graph alignment in correlated Erdös-Rény ...

Association for Computing Machinery (ACM)2019

Using Educational Data From Teaching And Learning To Inform Teachers’ Reflective Educational Design In Inquiry-Based STEM Education

Denis Gillet, Maria Jesus Rodriguez Triana

Science, Technology, Engineering and Mathematics (STEM) education is recognized as a top priority for school education worldwide and Inquiry-based teaching and learning is identified as one of the most dominant approaches. To effectively engage individual ...

2019

New Tools for MOOC/MOOL to Sustain Continuity of Experimentation in Control

Denis Gillet, Christophe Salzmann, Yves Henri Philippe Piguet

The use of interactive tools combined with remote laboratories has shown to be very useful for students when offered in a MOOC. The EPFL hands-on Control MOOC enables students to switch back and forth between control and observation on a remote laboratory, ...

Elsevier2019

, ,

We propose fingerprinting, a new technique that consists in constructing compact, fast-to-compute and privacy-preserving binary representations of datasets. We illustrate the effectiveness of our approach on the emblematic big data problem of K-Nearest-Nei ...

2019

Increasing reuse in learning objects authoring: a case study with the Cacuria tool

Roberto Gerson De Albuquerque Azevedo

Artifacts and best practices reuse as a way of improving educational resources and easing and speeding up the authoring process have been an important theme since the earliest research efforts on Learning Objects (LOs). In such a context, authoring tools t ...

ASSOC COMPUTING MACHINERY2019

Data is pervasive in today's world and has actually been for quite some time. With the increasing volume of data to process, there is a need for faster and at least as accurate techniques than what we already have. In particular, the last decade recorded t ...

EPFL2018