Sciweavers

5 search results - page 1 / 1
» Fast Kernels for Inexact String Matching
Sort
View
COLT
2003
Springer
13 years 10 months ago
Fast Kernels for Inexact String Matching
Christina S. Leslie, Rui Kuang
NIPS
2008
13 years 6 months ago
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
CF
2008
ACM
13 years 6 months ago
Exact multi-pattern string matching on the cell/b.e. processor
String searching is the computationally intensive kernel of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filter...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
ADC
2008
Springer
141views Database» more  ADC 2008»
13 years 11 months ago
Approximate Retrieval of XML Data with ApproXPath
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...
Lin Xu, Curtis E. Dyreson
BMCBI
2007
93views more  BMCBI 2007»
13 years 4 months ago
SVM-Fold: a tool for discriminative multi-class protein fold and superfamily recognition
Background: Predicting a protein’s structural class from its amino acid sequence is a fundamental problem in computational biology. Much recent work has focused on developing ne...
Iain Melvin, Eugene Ie, Rui Kuang, Jason Weston, W...