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.
In this note, we study certain sufficient conditions for a set of minimal klt pairs ( X, triangle) with kappa ( X, triangle) = dim( X ) - 1 to be bounded. ...
Chirok is software for a post-refinement test of the absolute structure. The software allows a user to calculate a distribution of the measure of chirality based on intensity quotients and linked to the Flack parameter. The distribution is fitted by a set ...
Grading student SQL queries manually is a tedious and error-prone process. Earlier work on testing correctness of student SQL queries, such as the XData system, can be used to test the correctness of a student query. However, in case a student query is fou ...
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 ...
The valorisation of the plant biopolymer lignin is now recognised as essential to enabling the economic viability of the lignocellulosic biorefining industry. In this context, the "lignin-first" biorefining approach, in which lignin valorisation is conside ...
In this paper, we propose a novel unsupervised approach for sequence matching by explicitly accounting for the locality properties in the sequences. In contrast to conventional approaches that rely on frame-to-frame matching, we conduct matching using sequ ...
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 ...
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 ...
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 ...
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 ...