Sciweavers

672 search results - page 33 / 135
» Words and forbidden factors
Sort
View
69
Voted
APPML
2007
165views more  APPML 2007»
14 years 9 months ago
On the Iwasawa decomposition of a symplectic matrix
We consider the computation of the Iwasawa decomposition of a symplectic matrix via the QR factorization. The algorithms presented improve on the method recently decribed in [8]. K...
Michele Benzi, Nader Razouk
96
Voted
ACL
2012
12 years 12 months ago
Probabilistic Integration of Partial Lexical Information for Noise Robust Haptic Voice Recognition
This paper presents a probabilistic framework that combines multiple knowledge sources for Haptic Voice Recognition (HVR), a multimodal input method designed to provide efficient...
Khe Chai Sim
ICALP
2009
Springer
15 years 9 months ago
The Ehrenfeucht-Silberger Problem
We consider repetitions in words and solve a longstanding open problem about the relation between the period and the length of its longest unbordered factor. A word u is called bor...
Stepan Holub, Dirk Nowotka
84
Voted
NAACL
1994
14 years 10 months ago
Use of Lexical and Syntactic Techniques in Recognizing Handwritten Text
The output of handwritten word recognizers (WR) tends to be very noisy due to various factors. In order to compensate for this behaviour, several choices of the WR must be initial...
Rohini K. Srihari
ITA
2007
118views Communications» more  ITA 2007»
14 years 9 months ago
Uniformly bounded duplication codes
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing dupl...
Peter Leupold, Victor Mitrana