779 search results - page 120 / 156 » Determining Time of Queries for Re-ranking Search Results |
BMCBI
2007
13 years 7 months ago
2007
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
MTA
2007
13 years 7 months ago
2007
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...
SCCC
2003
IEEE
14 years 20 days ago
2003
IEEE
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
Hidden Markov models (HMMs) have received considerable attention in various communities (e.g, speech recognition, neurology and bioinformatic) since many applications that use HMM...
ERCIMDL
2007
Springer
14 years 1 months ago
2007
Springer
Modern digital music libraries contain textual, visual, and audio data describing music on various semantic levels. Exploiting the availability of different semantically interrela...