Found 6 document(s)
Page 1 of 1
-
An impressive recent line of work has charted the complexity landscape of distributed graph algorithms. For many settings, it has been determined which time complexities exist, and which do not (in the sense that no loca...
-
Local certification is a distributed mechanism enabling the nodes of a network to check the correctness of the current configuration, thanks to small pieces of information called certificates. For many classic global pro...
-
In the field of sensitivity analysis of model outputs, the most popular methods are those based on the variance decomposition of the output, such as the Sobol’ indices, as they allow defining easy-to-interpret indices me...
-
(This is the long version of the paper accepted to SOFSEM 2014) In this paper we study the Sparsest k-Subgraph problem which consists in finding a subset of k vertices in a graph which induces the minimum number of edges...
-
The context of our study is industrial reliability, where lifetime data are usually censored and in small number. Background information is available from experts. Our prior subjective knowledge is only about the lifetim...