In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
Perfect Space-Time Codes are optimal codes in their original construction for Multiple Input Multiple Output (MIMO) systems. Based on cyclic division algebras, they are full-rate,...
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
lye propose a lossy image coding scheme based on the recently introduced even-stacked cosine modulated filter banks (CSIFBs) that allow linear phase filters in all channels. We des...