Sciweavers

356 search results - page 44 / 72
» Continuous Nearest Neighbor Search
Sort
View
112
Voted
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
16 years 18 days ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
297
Voted
ICDAR
2011
IEEE
14 years 2 days 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
VLDB
2007
ACM
169views Database» more  VLDB 2007»
16 years 21 days ago
Peer-to-Peer Similarity Search in Metric Spaces
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
Christos Doulkeridis, Akrivi Vlachou, Yannis Kotid...
106
Voted
JMLR
2010
111views more  JMLR 2010»
14 years 7 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
88
Voted
GECCO
2003
Springer
15 years 5 months ago
Optimization Using Particle Swarms with Near Neighbor Interactions
This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. ...
Kalyan Veeramachaneni, Thanmaya Peram, Chilukuri K...