Sciweavers

356 search results - page 35 / 72
» Continuous Nearest Neighbor Search
Sort
View
117
Voted
COMPGEOM
2006
ACM
15 years 8 months ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy
CIVR
2003
Springer
269views Image Analysis» more  CIVR 2003»
15 years 7 months ago
HPAT Indexing for Fast Object/Scene Recognition Based on Local Appearance
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
Hao Shao, Tomás Svoboda, Tinne Tuytelaars, ...
123
Voted
ICML
1994
IEEE
15 years 6 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
129
Voted
GIS
2008
ACM
15 years 3 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
103
Voted
ER
2004
Springer
144views Database» more  ER 2004»
15 years 8 months ago
Expressing and Optimizing Similarity-Based Queries in SQL
Searching for similar objects (in terms of near and nearest neighbors) of a given query object from a large set is an essential task in many applications. Recent years have seen g...
Like Gao, Min Wang, Xiaoyang Sean Wang, Sriram Pad...