Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Given a set of N multi-dimensional points, we study the computation of -quantiles according to a ranking function F, which is provided by the user at runtime. Specifically, F compu...
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
Abstract: Efficient content-based similarity search in large multimedia databases requires efficient query processing algorithms for many practical applications. Especially in hi...
Abstract— Detecting and unraveling incipient coordinated attacks on Internet resources requires a distributed network monitoring infrastructure. Such an infrastructure will have ...