868 search results - page 8 / 174 » A general compression algorithm that supports fast searching |
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
We present data representations, distance measures and organizational structures for fast and efficient retrieval of similar shapes in image databases. Using the Hough Transform w...
CPM
2010
Springer
14 years 12 days ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
OneClassMaxMinOver (OMMO) is a simple incremental algorithm for one-class support vector classification. We propose several enhancements and heuristics for improving model select...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
BIRD
2007
Springer
13 years 11 months ago
2007
Springer
Fast search algorithms for finding good instances of patterns given as position specific scoring matrices are developed, and some empirical results on their performance on DNA sequ...