141 search results - page 5 / 29 » Distance Based Indexing for String Proximity Search |
101
click to vote
ALENEX
2001
14 years 11 months ago
2001
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
AS-Index is a new index structure for exact string search in disk resident databases. It uses hashing, unlike known alternate structures, tree or trie based, and indexes every n-g...
160
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
101
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Boosted one-versus-all (OVA) classifiers are commonly used in multiclass problems, such as generic object recognition, biometrics-based identification, or gesture recognition. Join...