Sciweavers

824 search results - page 27 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
208
Voted
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
16 years 8 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 7 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
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
16 years 9 months ago
Distance Oracles for Spatial Networks
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
Jagan Sankaranarayanan, Hanan Samet

Publication
322views
16 years 8 days ago
Three-dimensional point cloud recognition via distributions of geometric distances
Ageometric framework for the recognition of three-dimensional objects represented by point clouds is introducedin this paper. The proposed approach is based on comparing distribut...
Mona Mahmoudi, Guillermo Sapiro
DICTA
2003
15 years 8 months ago
A New Shape Matching Measure for Nonlinear Distorted Object Recognition
In this paper, we present a new approach for hand-written character and digit recognitions based on shape descriptor and the Hausdorff Context. We start at finding the correspondi...
Sanun Srisuk, Marut Tamsri, Rerkchai Fooprateepsir...