331 search results - page 23 / 67 » Fast Matching for All Pairs Similarity Search |
SAC
2011
ACM
14 years 14 days ago
2011
ACM
Although the Web lets users freely browse and publish information, most Web information is unauthorized in contrast to conventional mass media. Therefore, it is not always credibl...
BMCBI
2006
14 years 9 months ago
2006
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
CIVR
2005
Springer
15 years 3 months ago
2005
Springer
This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normali...
CIAC
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
102
click to vote
CIKM
1998
Springer
15 years 1 months ago
1998
Springer
An important investigation of time series involves searching for \movement" patterns, such as \going up" or \going down" or some combinations of them. Movement patt...