Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
We propose a new approach, based on the Conley index theory, for the detection and classification of critical regions in multidimensional data sets. The use of homology groups ma...
Madjid Allili, David Corriveau, Sara Deriviè...
Online communities like Flickr, del.icio.us and YouTube have established themselves as very popular and powerful services for publishing and searching contents, but also for ident...
Tom Crecelius, Mouna Kacimi, Sebastian Michel, Tho...
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...