Decision trees (DTs) epitomize the ideal of interpretability of machine learning (ML) models.
The interpretability of decision trees motivates explainability approaches by so-called …

Cyber-physical systems (CPSs) are the next generation of engineered systems in which
computing, communication, and control technologies are tightly integrated. Research on …

Decision trees (DTs) epitomize what have become to be known as interpretable machine
learning (ML) models. This is informally motivated by paths in DTs being often much smaller …

Recent work has shown that not only decision trees (DTs) may not be interpretable but also
proposed a polynomial-time algorithm for computing one PI-explanation of a DT. This paper …

Wireless sensor network applications often involve the computation of pre-defined functions
of the measurements such as for example the arithmetic mean or maximum value. Standard …

We study network response to a stream of queries that require computations on remotely
located data, and we seek to characterize the network performance limits in terms of …

The-QMAC problem is introduced, involving S servers, K classical () data streams, and T
independent quantum systems. Data stream is replicated at a subset of servers, and …

In this paper, we consider different aspects of the problem of compressing for function
computation across a network, which we call network functional compression. In network …

The problem of network function computation over a directed acyclic network is investigated
in this paper. In such a network, a sink node desires to compute with zero error a target …

We consider the problem of information aggregation in sensor networks, where one is
interested in computing a function of the sensor measurements. We allow for block …