Sciweavers

1244 search results - page 30 / 249
» Searching in Higher Dimension
Sort
View
COCOON
2007
Springer
14 years 1 months ago
An Improved Algorithm for Online Unit Clustering
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...
Hamid Zarrabi-Zadeh, Timothy M. Chan
CMA
2011
13 years 4 months ago
Detecting critical regions in multidimensional data sets
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è...
PVLDB
2008
205views more  PVLDB 2008»
13 years 9 months ago
Making SENSE: socially enhanced search and exploration
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...
WEA
2010
Springer
280views Algorithms» more  WEA 2010»
14 years 4 months ago
Practical Nearest Neighbor Search in the Plane
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 ...
Michael Connor, Piyush Kumar
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
14 years 2 months ago
Better Bounds on Online Unit Clustering
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...
Martin R. Ehmsen, Kim S. Larsen