We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
We investigate the problem of converting sets of sensors into strongly connected networks of sensors using multiple directional antennae. Consider a set S of n points in the plane...
Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi,...
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...
Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin No...
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, ...