Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
An important area of data mining is anomaly detection, particularly for fraud. However, little work has been done in terms of detecting anomalies in data that is represented as a g...
An array-based algorithm for multichannel lattice filtering is proposed. The filter is formed by a set of units that are adapted locally and concurrently using recursions that clos...
During social interactions in a community, there are often sub-communities that behave in opposite manner. These antagonistic sub-communities could represent groups of people with ...