320 search results - page 22 / 64 » A New Compression Method with Fast Searching on Large Databa... |
CVPR
2010
IEEE
13 years 7 months ago
2010
IEEE
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
KDD
1998
ACM
14 years 21 days ago
1998
ACM
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Sub-image search with high accuracy in natural images still remains a challenging problem. This paper proposes a new feature vector called profile for a keypoint in a bag of visual...
DASFAA
2009
IEEE
14 years 11 days ago
2009
IEEE
Observing that current Global Similarity Measures (GSM) which average the effect of few significant differences on all dimensions may cause possible performance limitation, we prop...
ICDE
1998
IEEE
14 years 22 days ago
1998
IEEE
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...