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.
A binary tanglegram is a pair (S, T) of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics, it is essential that both trees are drawn without edge ...
Extensive efforts have been made in recent years to restore rivers with a view to increasing the ecological value of riparian areas and the surrounding landscape and to improving the protection provided against extreme flooding events. One of the important ...
A description of the bog-pine (Pinus uncinata var. rotundata) dominated vegetation of uncut oligotrophic mires affected by drainage is given. Surveys were carried out at 17 sites along the Jura Mountains (Switzerland and France) in 1993, 1994, and 1995. Ra ...
Searching and traversing m-way trees using tries is a well known and broadly used technique. Three algorithms are presented, two have constant insert, search and delete cost, are faster than Hash Trees and can be searched twice as quickly cas Ternary Searc ...
The Algebra of Connectors AC(P) is used to model structured interactions in the BIP component framework. Its terms are connectors, relations describing synchronization constraints between the ports of component-based systems. Connectors are structured comb ...
Binomial heaps are data structures implemented as a collection of binomial trees, (A binomial tree of order K can be constructed from two trees of order (K-1)). They can implement several methods: Min, Insert, Union, ExtractMin, DecreaseKey and Delete. Fib ...
Forest ecosystems show diverse and evolving structures. Accurate descriptions and a good knowledge of these environments are therefore a real challenge. Existing forest cover investigation methods are mostly laborious, hard to replicate and usually based o ...
In Jura bogs, on deep and nutrient-poor peat, the ecotone between bog pine forest and Norway spruce forest is sharp and, in a few disturbed situations, no succession pine forest-spruce forest occurs. The bog Les Saignolis lies at the top of an anticline, o ...
This report presents a robust syntactic parser that is able to return a "correct" derivation tree even if the grammar cannot generate the input sentence. The following two step solution is prop osed: the finest corresponding most probable optimal maximum c ...
This paper studies the multicast routing and admission control problem on unit-capacity tree and mesh topologies in the throughput model. The problem is a generalization of the edge-disjoint paths problem and is NP-hard both on trees and meshes. We study b ...