Computing Set Intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustnes...
Dana Dachman-Soled, Tal Malkin, Mariana Raykova, M...
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
Taolue Chen, Bas Ploeger, Jaco van de Pol, Tim A. ...
We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous i...
Pawel Zebrowski, Yaroslav Litus, Richard T. Vaugha...
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
This paper discusses the problem of efficient propagation of uncertain information in dynamic environments and critical situations. When a number of (distributed) agents have only ...