In this paper a new and efficient supervised method for color image segmentation is presented. This method improves a part of the automatic extraction problem. The basic technique...
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
This paper illustrates the thesis research and process that led me to conceive, design and evaluate the Phototropic Memories device, a novel interface supporting the intimate shar...
Starting from an axiomatization of a generalization of Shannon entropy we introduce a set of axioms for a parametric family of distances over sets of partitions of finite sets. T...
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...