For smoothing covariance functions, we propose two fast algorithms that scale linearly with the number of observations per function. Most available methods and software cannot smo...
Luo Xiao, Vadim Zipunnikov, David Ruppert, Ciprian...
Abstract Principal component analysis (PCA) is a wellestablished tool for identifying the main sources of variation in multivariate data. However, as a linear method it cannot desc...
Abstract We present a new graph-based real-time task model that can specify complex job arrival patterns and global state-based mode switching. The mode switching is of a mixed-cri...
Ethernet-based time-triggered networks (e.g. TTEthernet) enable the cost-effective integration of safety-critical and real-time distributed applications in domains where determin...
— Hierarchical scheduling provides a means of composing multiple real-time applications onto a single processor such that the temporal requirements of each application are met. T...
Will Lunniss, Sebastian Altmeyer, Giuseppe Lipari,...
Audsley’s Optimal Priority Assignment (OPA) algorithm can be applied to multiprocessor scheduling provided that three conditions hold with respect to the schedulability tests us...
Robert I. Davis, Marko Bertogna, Vincenzo Bonifaci
The area of judicious partitioning considers the general family of partitioning problems in which one seeks to optimize several parameters simultaneously, and these problems have ...
The well-known “Janson’s inequality” gives Poisson-like upper bounds for the lower tail probability P(X (1 − ε)EX) when X is the sum of dependent indicator random variabl...
In this paper, we aim at analyzing the classical information spreading Push protocol in dynamic networks. We consider the edgeMarkovian evolving graph model which captures natural ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Carola...