Sciweavers

232 search results - page 2 / 47
» Fast High-Dimensional Data Search in Incomplete Databases
Sort
View
ICDE
2007
IEEE
228views Database» more  ICDE 2007»
13 years 11 months ago
A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Xiang Lian, Lei Chen 0002
PODS
1997
ACM
182views Database» more  PODS 1997»
13 years 9 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
DEXA
2006
Springer
190views Database» more  DEXA 2006»
13 years 9 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
ENGL
2008
160views more  ENGL 2008»
13 years 5 months ago
Vector Approximation based Indexing for High-Dimensional Multimedia Databases
With the proliferation of multimedia data, there is an increasing need to support the indexing and searching of high-dimensional data. In this paper, we propose an efficient indexi...
Imane Daoudi, Saîd El Alaoui Ouatik, A. El K...
IS
2006
13 years 5 months ago
High dimensional nearest neighbor searching
As databases increasingly integrate different types of information such as time-series, multimedia and scientific data, it becomes necessary to support efficient retrieval of mult...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...