Sciweavers

524 search results - page 37 / 105
» On the Performance of Clustering in Hilbert Spaces
Sort
View
SPIRE
2005
Springer
15 years 11 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
HUMO
2007
Springer
16 years 8 days ago
Robust Spectral 3D-Bodypart Segmentation Along Time
Abstract. In this paper we present a novel tool for body-part segmentation and tracking in the context of multiple camera systems. Our goal is to produce robust motion cues over ti...
Fabio Cuzzolin, Diana Mateus, Edmond Boyer, Radu H...
ICCS
2007
Springer
16 years 8 days ago
Searching and Updating Metric Space Databases Using the Parallel EGNAT
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
Mauricio Marín, Roberto Uribe, Ricardo J. B...
NLDB
2007
Springer
16 years 7 days ago
Combining Vector Space Model and Multi Word Term Extraction for Semantic Query Expansion
Abstract. In this paper, we target document ranking in a highly technical field with the aim to approximate a ranking that is obtained through an existing ontology (knowledge stru...
Eric SanJuan, Fidelia Ibekwe-Sanjuan, Juan Manuel ...
VLDB
2000
ACM
166views Database» more  VLDB 2000»
15 years 9 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...