74 search results - page 11 / 15 » Improved Approximate String Matching Using Compressed Suffix... |
102
click to vote
DAGSTUHL
2006
14 years 10 months ago
2006
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
81
Voted
ESWS
2006
Springer
15 years 1 months ago
2006
Springer
We present a new iterative algorithm for ontology mapping where we combine standard string distance metrics with a structural similarity measure that is based on a vector represent...
FPL
2005
Springer
15 years 2 months ago
2005
Springer
String pattern matching is a computationally expensive task, and when implemented in hardware, it can consume a large amount of resources for processing and storage. This paper pr...
BMCBI
2008
14 years 9 months ago
2008
Background: The use of novel algorithmic techniques is pivotal to many important problems in life science. For example the sequencing of the human genome [1] would not have been p...
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...