Sciweavers

108 search results - page 12 / 22
» Families of FPGA-Based Algorithms for Approximate String Mat...
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Efficiently learning linear-linear exponential family predictive representations of state
Exponential Family PSR (EFPSR) models capture stochastic dynamical systems by representing state as the parameters of an exponential family distribution over a shortterm window of...
David Wingate, Satinder P. Singh
ISAAC
2003
Springer
117views Algorithms» more  ISAAC 2003»
14 years 19 days ago
Approximate Regular Expression Searching with Arbitrary Integer Weights
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
Gonzalo Navarro
SPIRE
2005
Springer
14 years 28 days ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
12 years 11 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi
IFIPTCS
2000
13 years 11 months ago
An Index for Two Dimensional String Matching Allowing Rotations
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen