331 search results - page 1 / 67 » Fast Matching for All Pairs Similarity Search |
WEBI
2009
Springer
14 years 2 months ago
2009
Springer
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
JMLR
2010
13 years 2 months ago
2010
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 ...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
APWEB
2010
Springer
13 years 10 months ago
2010
Springer
Given a set of records, a threshold value t and a similarity function, we investigate the problem of finding all pairs of records such that similarity between each pair is above t....
CVPR
2010
IEEE
13 years 11 months ago
2010
IEEE
This paper addresses the problem of recognizing freeform 3D objects in point clouds. Compared to traditional approaches based on point descriptors, which depend on local informati...