Multi-instance (MI) learning is a variant of supervised learning where labeled examples consist of bags (i.e. multi-sets) of feature vectors instead of just a single feature vecto...
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve ...
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...