Sciweavers

224 search results - page 3 / 45
» Three New Algorithms for Regular Language Enumeration
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 6 months ago
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages
Abstract. The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability)...
Christian Glasser, Heinz Schmitz, Victor L. Seliva...
CIKM
1998
Springer
13 years 10 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
SYNASC
2005
IEEE
86views Algorithms» more  SYNASC 2005»
13 years 11 months ago
One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursivel...
Artiom Alhazov, Rudolf Freund, Agustin Riscos-N&ua...
IC3
2009
13 years 3 months ago
A New Approach towards Bibliographic Reference Identification, Parsing and Inline Citation Matching
A number of algorithms and approaches have been proposed towards the problem of scanning and digitizing research papers. We can classify work done in the past into three major appr...
Deepank Gupta, Bob Morris, Terry Catapano, Guido S...
EP
1998
Springer
13 years 10 months ago
Simplification of the Arabic Script: Three Different Approaches and their Implementations
Abstract. In 1945, the Cairo Academy for the Arabic Language opened a contest to find the best project for simplification of the Arabic writing system. They received about 200 repl...
Yannis Haralambous