634 search results - page 88 / 127 » Fast Evaluation Techniques for Complex Similarity Queries |
SEBD
1997
13 years 9 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
ISW
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we present free-start collisions for the TIB3 hash function with a complexity of about 232 compression function evaluations. By using message modification technique...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Near-duplicate web documents are abundant. Two such documents differ from each other in a very small portion that displays advertisements, for example. Such differences are irrele...
BMCBI
2008
13 years 8 months ago
2008
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
BMCBI
2010
13 years 8 months ago
2010
Background: Proteins show a great variety of 3D conformations, which can be used to infer their evolutionary relationship and to classify them into more general groups; therefore ...