1736 search results - page 9 / 348 » String Extension Learning |
133
click to vote
TCS
2008
14 years 10 months ago
2008
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
ICCCN
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper we present a hardware architecture for string matching. Our solution based on using a Bloom filter based pre-processor and a parallelized hashing engine is capab...
106
click to vote
FASE
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...