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.
From basic science to translation, modern biomedical research demands computational models which integrate several interacting physical systems. This paper describes the infrastructural framework for generic multiphysics integration implemented in the soft ...
We give a complete characterization of the locally compact groups that are nonelementary Gromov-hyperbolic and amenable. They coincide with the class of mapping tori of discrete or continuous one-parameter groups of compacting automorphisms. We moreover gi ...
Let C be a binary self-dual code with an automorphism g of order 2p, where p is an odd prime, such that gp is a fixed point free involution. If C is extremal of length a multiple of 24, all the involutions are fixed point free, except the Golay Code and ev ...
Institute of Electrical and Electronics Engineers2013
This project consisted in bringing the linker call graph up to date with dotty/master, restructure the code, make it support the full Scala language and make it support calls to Java code. Also implemented dead code elimination of unreachable methods based ...
Mining large graphs has now become an important aspect of multiple diverse applications and a number of computer systems have been proposed to provide runtime support. Recent interest in this area has led to the construction of single machine graph computa ...
We propose a framework that learns the graph structure underlying a set of smooth signals. Given a real m by n matrix X whose rows reside on the vertices of an unknown graph, we learn the edge weights w under the smoothness assumption that trace(X^TLX) is ...
Multiscale transforms designed to process analog and discrete-time signals and images cannot be directly applied to analyze high-dimensional data residing on the vertices of a weighted graph, as they do not capture the intrinsic topology of the graph data ...
Institute of Electrical and Electronics Engineers2016
We compute L-2-Betti numbers of postliminal, locally compact, unimodular groups in terms of ordinary dimensions of reduced cohomology with coefficients in irreducible unitary representations and the Plancherel measure. This allows us to compute the L-2-Bet ...
In the 1970s Erdos asked whether the chromatic number of intersection graphs of line segments in the plane is bounded by a function of their clique number. We show the answer is no. Specifically, for each positive integer k we construct a triangle-free fam ...
Motivated by the advantages of using elliptic curves for discrete logarithm-based public-key cryptography, there is an active research area investigating the potential of using hyperelliptic curves of genus 2. For both types of curves, the best known algor ...
