Sciweavers

331 search results - page 10 / 67
» Fast Matching for All Pairs Similarity Search
Sort
View
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
14 years 9 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
VIP
2003
14 years 11 months ago
Shape Similarity Search Using XML and Portal Technology
This paper proposed an out-sourcing system to improve the shape recognition in terms of the accuracy, speed, and also the accessibility of such tool over the Internet. The propose...
Man Hing Yu, Chee Chern Lim, Jesse S. Jin
PCM
2010
Springer
179views Multimedia» more  PCM 2010»
14 years 8 months ago
3D Similarity Search Using a Weighted Structural Histogram Representation
A fast and robust 3D retrieval method is proposed based on a novel weighted structural histogram representation. Our method has the following steps: 1) adaptively segment any 3D sh...
Tong Lu, Rongjun Gao, Tuantuan Wang, Yubin Yang
ICCV
2007
IEEE
15 years 11 months ago
Improving Descriptors for Fast Tree Matching by Optimal Linear Projection
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
Krystian Mikolajczyk, Jiri Matas
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
15 years 11 months ago
Fast Indexes and Algorithms for Set Similarity Selection Queries
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
Marios Hadjieleftheriou, Amit Chandel, Nick Koudas...