Sciweavers

99 search results - page 18 / 20
» On a class of finite symmetric graphs
Sort
View
JSA
2008
124views more  JSA 2008»
13 years 8 months ago
Processor array architectures for flexible approximate string matching
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
14 years 5 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
ICDAR
1995
IEEE
13 years 12 months ago
Efficient analysis of complex diagrams using constraint-based parsing
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the dat...
Robert P. Futrelle, Nikos Nikolakis
DM
2008
89views more  DM 2008»
13 years 8 months ago
Combinatorics of sequential dynamical systems
In this paper we study sequential dynamical systems (SDS) over words. Our main result is the classification of SDS over words for fixed graphY and family of local maps (Fvi ) by m...
Christian M. Reidys
NC
2010
137views Neural Networks» more  NC 2010»
13 years 3 months ago
On the regularity of circular splicing languages: a survey and new developments
Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we focu...
Paola Bonizzoni, Clelia de Felice, Gabriele Fici, ...