461 search results - page 2 / 93 » Letters |
LATA
2010
Springer
14 years 2 months ago
2010
Springer
We study pregroup grammars with letter promotions p(m) q(n) . We show that the Letter Promotion Problem for pregroups is solvable in polynomial time, if the size of p(n)
STOC
2002
ACM
14 years 5 months ago
2002
ACM
SSPR
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. Because of its unexpected nature, finding words as equidistant letter sequences (Torah codes) in a text may appear to be interesting. However, there is a significant prob...
ICPR
2010
IEEE
13 years 2 months ago
2010
IEEE
In the context of the NAVIDOMASS project, the problematic of this paper concerns the clustering of historical document images. We propose a structural-based framework to handle the...
DCC
2006
IEEE
13 years 8 months ago
2006
IEEE
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...