Sciweavers

4 search results - page 1 / 1
» String Kernels Based on Variable-Length-Don't-Care Patterns
Sort
View
DIS
2008
Springer
13 years 6 months ago
String Kernels Based on Variable-Length-Don't-Care Patterns
Abstract. We propose a new string kernel based on variable-lengthdon't-care patterns (VLDC patterns). A VLDC pattern is an element of ({}) , where is an alphabet and is the ...
Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shu...
PR
2006
152views more  PR 2006»
13 years 4 months ago
Edit distance-based kernel functions for structural pattern classification
A common approach in structural pattern classification is to define a dissimilarity measure on patterns and apply a distance-based nearest-neighbor classifier. In this paper, we i...
Michel Neuhaus, Horst Bunke
ESANN
2004
13 years 5 months ago
Neural methods for non-standard data
Standard pattern recognition provides effective and noise-tolerant tools for machine learning tasks; however, most approaches only deal with real vectors of a finite and fixed dime...
Barbara Hammer, Brijnesh J. Jain
ICS
2010
Tsinghua U.
13 years 9 months ago
Small-ruleset regular expression matching on GPGPUs: quantitative performance analysis and optimization
We explore the intersection between an emerging class of architectures and a prominent workload: GPGPUs (General-Purpose Graphics Processing Units) and regular expression matching...
Jamin Naghmouchi, Daniele Paolo Scarpazza, Mladen ...