Sciweavers

396 search results - page 58 / 80
» Factor Automata of Automata and Applications
Sort
View
CONIELECOMP
2005
IEEE
14 years 1 months ago
Approximate Searching on Compressed Text
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
Carlos Avendaño Pérez, Claudia Fereg...
ACRI
2004
Springer
14 years 29 days ago
Applying Cell-DEVS in 3D Free-Form Shape Modeling
Modeling free-form shapes in 3D spaces based on strict physical laws require a considerable amount of computation time. Previous experiences with Cellular Automata demonstrated sub...
Pengfei Wu, Xiuping Wu, Gabriel A. Wainer
WIA
2004
Springer
14 years 26 days ago
Brute Force Determinization of NFAs by Means of State Covers
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
Jean-Marc Champarnaud, Fabien Coulon, Thomas Paran...
SBACPAD
2003
IEEE
103views Hardware» more  SBACPAD 2003»
14 years 24 days ago
Performance Analysis Issues for Parallel Implementations of Propagation Algorithm
This paper presents a theoretical study to evaluate the performance of a family of parallel implementations of the propagation algorithm. The propagation algorithm is used to an i...
Leonardo Brenner, Luiz Gustavo Fernandes, Paulo Fe...
FM
2003
Springer
174views Formal Methods» more  FM 2003»
14 years 23 days ago
Model-Checking TRIO Specifications in SPIN
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
Angelo Morzenti, Matteo Pradella, Pierluigi San Pi...