911 search results - page 16 / 183 » On the Distance of Databases |
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, the integrated probability function (IPF) on local mean distance for image recognition was proposed to combine features for the best performance. Experiments were p...
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...