Abstract. The proliferation of sensor networks in various areas of technology has enabled real-time behavioral monitoring of various physical systems in various length and time sca...
John Michopoulos, Charbel Farhat, Elias N. Houstis
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...
Data-intensive, interactive applications are an important class of metacomputing (Grid) applications. They are characterized by large, time-varying data flows between data provid...
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
Abstract. We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required s...
Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas,...