Sciweavers

245 search results - page 49 / 49
» Letter from the chair
Sort
View
IJAC
2007
116views more  IJAC 2007»
13 years 6 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil
SIGPRO
2008
155views more  SIGPRO 2008»
13 years 6 months ago
Recognition of off-line printed Arabic text using Hidden Markov Models
This paper describes a technique for automatic recognition of off-line printed Arabic text using Hidden Markov Models. In this work different sizes of overlapping and non-overlapp...
Husni A. Al-Muhtaseb, Sabri A. Mahmoud, Rami Qahwa...
IJDAR
2011
214views more  IJDAR 2011»
13 years 1 months ago
SCUT-COUCH2009 - a comprehensive online unconstrained Chinese handwriting database and benchmark evaluation
: A comprehensive online unconstrained Chinese handwriting dataset, SCUT-COUCH2009, is introduced in this paper. As a revision of SCUT-COUCH2008 [1], the SCUT-COUCH2009 database co...
Lianwen Jin, Yan Gao, Gang Liu, Yunyang Li, Kai Di...
SCL
2011
12 years 9 months ago
Regularity issues for the null-controllability of the linear 1-d heat equation
The fact that the heat equation is controllable to zero in any bounded domain of the euclidean space, any time T > 0 and from any open subset of the boundary is well known. On ...
Sorin Micu, Enrique Zuazua
STACS
2007
Springer
14 years 11 days ago
Reachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman