Sciweavers

2089 search results - page 11 / 418
» A New Problem in String Searching
Sort
View
PRL
2002
91views more  PRL 2002»
14 years 9 months ago
StrCombo: combination of string recognizers
In this paper, we contribute a new paradigm of combining string recognizers and propose generic frameworks for hierarchical and parallel combination of multiple string recognizers...
Xiangyun Ye, Mohamed Cheriet, Ching Y. Suen
CPM
2009
Springer
121views Combinatorics» more  CPM 2009»
15 years 4 months ago
LCS Approximation via Embedding into Local Non-repetitive Strings
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
Gad M. Landau, Avivit Levy, Ilan Newman
BIBM
2009
IEEE
113views Bioinformatics» more  BIBM 2009»
15 years 28 days ago
Fast Motif Selection for Biological Sequences
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
Pavel P. Kuksa, Vladimir Pavlovic
ACL
2007
14 years 11 months ago
Grammar Approximation by Representative Sublanguage: A New Model for Language Learning
We propose a new language learning model that learns a syntactic-semantic grammar from a small number of natural language strings annotated with their semantics, along with basic ...
Smaranda Muresan, Owen Rambow
AIPS
2008
14 years 12 months ago
A New Local Search for the Job Shop Problem with Uncertain Durations
In the sequel we consider the job shop scheduling problem with uncertain durations represented as triangular fuzzy numbers. We propose a new neighbourhood structure for local sear...
Inés González Rodríguez, Cami...