Sciweavers

147 search results - page 9 / 30
» Nearest neighbor search through function minimization
Sort
View
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
15 years 4 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
77
Voted
PR
2006
132views more  PR 2006»
14 years 9 months ago
Some approaches to improve tree-based nearest neighbour search algorithms
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
Eva Gómez-Ballester, Luisa Micó, Jos...
GIS
2008
ACM
14 years 10 months ago
Similarity-based prediction of travel times for vehicles traveling on known routes
The use of centralized, real-time position tracking is proliferating in the areas of logistics and public transportation. Real-time positions can be used to provide up-to-date inf...
Dalia Tiesyte, Christian S. Jensen
GIS
2008
ACM
15 years 10 months ago
Monitoring continuous queries over streaming locations
We report on our experience from design and implementation of a powerful map application for managing, querying and visualizing evolving locations of moving objects. Instead of bu...
Kostas Patroumpas, Evi Kefallinou, Timos K. Sellis
ICML
2010
IEEE
14 years 10 months ago
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang