Sciweavers

329 search results - page 6 / 66
» Fast structural similarity index algorithm
Sort
View
ICDIM
2008
IEEE
14 years 1 months ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu
ICPR
2008
IEEE
14 years 1 months ago
Fast approximate kernel-based similarity search for image retrieval task
In content based image retrieval, the success of any distance-based indexing scheme depends critically on the quality of the chosen distance metric. We propose in this paper a ker...
David Gorisse, Matthieu Cord, Frédér...
BMCBI
2006
129views more  BMCBI 2006»
13 years 7 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
WWW
2005
ACM
14 years 8 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan
SIGMOD
2004
ACM
149views Database» more  SIGMOD 2004»
14 years 7 months ago
Incremental Maintenance of XML Structural Indexes
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
Ke Yi, Hao He, Ioana Stanoi, Jun Yang 0001