Sciweavers

430 search results - page 17 / 86
» A New Linearizing Restriction in the Pattern Matching Proble...
Sort
View
FOCS
2009
IEEE
13 years 12 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
AUTOMATICA
2007
111views more  AUTOMATICA 2007»
13 years 8 months ago
Output feedback variable structure control for linear systems with uncertainties and disturbances
This paper proposes a dynamic output feedback variable structure controller for linear MIMO systems with mismatched and matched normbounded uncertainties and matched nonlinear dis...
PooGyeon Park, Doo Jin Choi, Seong G. Kong
BMCBI
2011
12 years 11 months ago
Structator: fast index-based search for RNA sequence-structure patterns
Background: The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching dat...
Fernando Meyer, Stefan Kurtz, Rolf Backofen, Sebas...
SIAMMA
2011
98views more  SIAMMA 2011»
13 years 2 months ago
Time-Periodic Linearized Solutions of the Compressible Euler Equations and a Problem of Small Divisors
It has been unknown since the time of Euler whether or not time-periodic sound wave propagation is physically possible in the compressible Euler equations, due mainly to the ubiqui...
Blake Temple, Robin Young
JDA
2007
73views more  JDA 2007»
13 years 8 months ago
Parameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
Alberto Apostolico, Péter L. Erdös, Mo...