Sciweavers

1361 search results - page 60 / 273
» Spaces of practice
Sort
View
JEA
2008
112views more  JEA 2008»
13 years 10 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
FOCS
2006
IEEE
14 years 4 months ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Alexandr Andoni, Piotr Indyk
ICFCA
2005
Springer
14 years 3 months ago
On Computing the Minimal Generator Family for Concept Lattices and Icebergs
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
Kamal Nehmé, Petko Valtchev, Mohamed Rouane...
ICIP
1999
IEEE
14 years 11 months ago
Unsupervised Low-Frequency Driven Segmentation of Color Images
This paper presents an algorithm for unsupervised segmentation of color images. The main idea behind it is the use of the low-frequency content of images which allows for smoothin...
Luca Lucchese, Sanjit K. Mitra
SMI
2007
IEEE
129views Image Analysis» more  SMI 2007»
14 years 4 months ago
Localized Homology
In this paper, we introduce localized homology, a theory for finding local geometric descriptions for topological attributes. Given a space and a cover of subspaces, we construct...
Afra Zomorodian, Gunnar Carlsson