Given a planar set S of arbitrary topology and a radius r, we show how to construct an r-tightening of S, which is a set whose boundary has a radius of curvature everywhere greate...
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
Yingchang Xiang, Dechang Chen, Xiuzhen Cheng, Kai ...
: Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimizatio...
This paper addresses the problem of representing the set of repairs of a possibly inconsistent database by means of a disjunctive database. Specifically, the class of denial constr...
Cristian Molinaro, Jan Chomicki, Jerzy Marcinkowsk...