Abstract As a generalization of de-disjunct matrices and (w,r;d)-cover-freefamilies, the notion of (s,l)e-disjunct matrices is introduced for error-correcting pooling designs over ...
ABSTRACT. We prove the rationality of the generating function associated to the number of equivalence classes of Fqk -points of a constructible equivalence relation defined over t...
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...