154 search results - page 20 / 31 » Approximate String Matching: A Simpler Faster Algorithm |
107
click to vote
IJFCS
2006
14 years 11 months ago
2006
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...
ICML
2008
IEEE
16 years 14 days ago
2008
IEEE
We have developed a new Linear Support Vector Machine (SVM) training algorithm called OCAS. Its computational effort scales linearly with the sample size. In an extensive empirica...
JDA
2008
14 years 11 months ago
2008
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
AIRS
2004
Springer
15 years 5 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
102
click to vote
ICML
2010
IEEE
15 years 22 days ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...