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.
Let P be a partially ordered set. If the Boolean lattice (2[n],⊂) can be partitioned into copies of P for some positive integer n, then P must satisfy the following two trivial conditions: (1) the size of P is a power of 2, (2) P has a unique maximal and m ...
Persistent and bioaccumulative pollutants (PBPs) are continually introduced into the environment as a part of the massive ongoing chemical production that began several decades ago. The PBPs include several chemical families such as: industrial compounds, ...
We show that the Chow covectors of a linkage matching field define a bijection of lattice points and we demonstrate how one can recover the linkage matching field from this bijection. This resolves two open questions from Sturmfels & Zelevinsky (1993) on l ...
In this work we propose a novel fully distributed approach to endow robots in a swarm with awareness of their relative position with respect to the rest of the swarm. Such spatial awareness can be used to support spatially differentiated task allocation or ...
We study the Lonely Runner Conjecture, conceived by Jörg M. Wills in the 1960's: Given positive integers n_1, n_2, ... , n_k, there exists a positive real number t such that for all 1 \le j \le k the distance of t n_j to the nearest integer is at least 1 / ...
A well-studied special case of bin packing is the 3-partition problem, where n items of size > 1/4 have to be packed in a minimum number of bins of capacity one. The famous Karmarkar-Karp algorithm transforms a fractional solution of a suitable LP relaxati ...
In this paper, we present a graph partitioning algorithm to partition graphs with trillions of edges. To achieve such scale, our solution leverages the vertex-centric Pregel abstraction provided by Giraph, a system for large-scale graph analytics. We desig ...
We consider the parabolic Anderson model on Zd driven by fractional noise. We prove that it has a mild solution given by Feynman-Kac representation which coincides with the partition function of a directed polymer in a fractional Brownian envir ...
In many 3-D object-detection and pose-estimation problems, run-time performance is of critical importance. However, there usually is time to train the system. We introduce an approach that takes advantage of this fact by formulating wide-baseline matching ...
It is known that not all summation methods are linear and stable. Zeta function regularization is in general nonlinear. However, in some cases formal manipulations with zeta function regularization (assuming linearity of sums) lead to correct results. We c ...
