Sciweavers

216 search results - page 9 / 44
» From Constraints to Finite Automata to Filtering Algorithms
Sort
View
CORR
2010
Springer
132views Education» more  CORR 2010»
13 years 7 months ago
Small NFAs from Regular Expressions: Some Experimental Results
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
Hugo Gouveia, Nelma Moreira, Rogério Reis
VLSI
2010
Springer
13 years 5 months ago
Design of low-complexity and high-speed digital Finite Impulse Response filters
—In this paper, we introduce a design methodology to implement low-complexity and high-speed digital Finite Impulse Response (FIR) filters. Since FIR filters suffer from a larg...
Diego Jaccottet, Eduardo Costa, Levent Aksoy, Paul...
PAAMS
2010
Springer
13 years 5 months ago
A Case Study on Grammatical-Based Representation for Regular Expression Evolution
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
Antonio González-Pardo, David F. Barrero, D...
ISBI
2008
IEEE
14 years 8 months ago
Tomographic image reconstruction from limited-view projections with Wiener filtered focuss algorithm
In tomographic image reconstruction from limited-view projections the underlying inverse problem is ill-posed with the rank-deficient system matrix. The minimal-norm least squares...
Rafal Zdunek, Zhaoshui He, Andrzej Cichocki
DLT
2009
13 years 5 months ago
Weighted versus Probabilistic Logics
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
Benedikt Bollig, Paul Gastin