Sciweavers

27 search results - page 3 / 6
» Supporting Subseries Nearest Neighbor Search via Approximati...
Sort
View
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 3 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
ICDAR
2011
IEEE
12 years 8 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
DEXA
2006
Springer
190views Database» more  DEXA 2006»
14 years 8 days 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 8 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...
VLDB
2007
ACM
191views Database» more  VLDB 2007»
14 years 8 months ago
Multidimensional reverse k NN search
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
Yufei Tao, Dimitris Papadias, Xiang Lian, Xiaokui ...