Stem letter$ (all stems)

48 papers:

DHM-HM-2015-WangHM15a #case study

A Study on Characteristic of Calligraphy Characters Part 3 Case of the Writing Paper with Calligraphy Letter Works (ZW, RH, ZM), pp. 437–444.

DHM-HM-2015-WangLYHM #case study

A Study on Characteristic of Calligraphy Characters Part 2 Case of One Character of Calligraphy Letter “Kanji” and “Hiragana” (ZW, ML, KY, RH, ZM), pp. 429–436.

HCI-IT-2015-MutoM #analysis #development #interactive

Analysis of Eye Hand Interaction in Drawing Figure and Letter — For the Development of Handwrite-Training Device (YM, TM), pp. 107–117.

HCI-AS-2014-BangSKSSWW #interface

Digital Love Letter: A Handwriting Based Interface for Non-instant Digital Messenger (SJB, YS, JDK, KS, CKS, GW, SW), pp. 103–113.

ICPR-2014-Dahllof #classification

Scribe Attribution for Early Medieval Handwriting by Means of Letter Extraction and Classification and a Voting Procedure for Larger Pieces (MD), pp. 1910–1915.

DLT-2013-JezO #ambiguity #boolean grammar

Unambiguous Conjunctive Grammars over a One-Letter Alphabet (AJ, AO), pp. 277–288.

CHI-2013-RoyMGLE #gesture

Augmented letters: mnemonic gesture-based shortcuts (QR, SM, YG, EL, JE), pp. 2325–2328.

DRR-2012-Bianne-BernardMLMK #modelling #recognition #word

Variable length and context-dependent HMM letter form models for Arabic handwritten word recognition (ALBB, FM, LLS, CM, CK).

DLT-2011-CherubiniFP #word

Short 3-Collapsing Words over a 2-Letter Alphabet (AC, AF, BP), pp. 469–471.

AFL-J-2008-KlimaP10a

Literally Idempotent Languages and their Varieties — Two Letter Case (OK, LP), pp. 761–780.

LATA-2010-BuszkowskiL

Pregroup Grammars with Letter Promotions (WB, ZL), pp. 130–141.

ICDAR-2009-CoustatyOPV #composition

Drop Caps Decomposition for Indexing a New Letter Extraction Method (MC, JMO, RP, NV), pp. 476–480.

ICDAR-2009-LandreMR #classification #difference #image #using

Ornamental Letters Image Classification Using Local Dissimilarity Maps (JL, FMN, SR), pp. 186–190.

ICDAR-2009-SidereHR #classification #graph #representation

Vector Representation of Graphs: Application to the Classification of Symbols and Letters (NS, PH, JYR), pp. 681–685.

AFL-2008-AfoninK #regular expression

Semigroups of regular languages over a one letter alphabet are rational (SA, EK), pp. 61–73.

AFL-2008-KlimaP

Literally idempotent languages and their varieties — two letter case (OK, LP), pp. 220–231.

SAC-2008-RadtkeSW #algorithm #classification #using

Using the RRT algorithm to optimize classification systems for handwritten digits and letters (PVWR, RS, TW), pp. 1748–1752.

ICDAR-2007-LemaitreGP #2d #analysis #approach #layout #markov

Preliminary experiments in layout analysis of handwritten letters based on textural and spatial information and a 2D Markovian approach (ML, EG, FJP), pp. 1023–1027.

ICDAR-2007-RamirezTBR #algorithm #linear #robust

Quantile Linear Algorithm for Robust Binarization of Digitalized Letters (MR, ET, MB, RR), pp. 1158–1162.

DLT-2007-BelovsRS #automaton #finite #multi #quantum

Multi-letter Reversible and Quantum Finite Automata (AB, AR, JS), pp. 60–71.

HCI-IPT-2007-ChoH #recognition

Drawing Type Tactile Presentation for Tactile Letter Recognition (JHC, MH), pp. 798–807.

DLT-2006-AnanichevVZ #automaton

Synchronizing Automata with a Letter of Deficiency 2 (DSA, MVV, YIZ), pp. 433–442.

ICPR-v2-2006-ParetiV

Ancient Initial Letters Indexing (RP, NV), pp. 756–759.

ICPR-v3-2006-BombachG #sequence

Patterns of Co-Linear Equidistant Letter Sequences and Verses (NB, HG), pp. 149–151.

ICPR-v3-2006-BombachG06a #sequence

Patterns of Co-Linear Equidistant Letter Sequences and Verses (NB, HG), pp. 1248–1250.

ICPR-v4-2006-BombachG06b #sequence

Patterns of Co-Linear Equidistant Letter Sequences and Verses (NB, HG), p. 961.

ICDAR-2005-RousseauAC #online #order #recognition

Recovery of a Drawing Order from Off-Line Isolated Letters Dedicated to On-Line Recognition (LR, ÉA, JC), pp. 1121–1125.

DLT-2005-Saari #on the #sequence

On the Frequency of Letters in Pure Binary Morphic Sequences (KS), pp. 397–408.

DLT-2004-AnselmoGM #2d #regular expression

Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet (MA, DG, MM), pp. 63–75.

ICPR-v2-2004-DupreA #markov #modelling #recognition

Hidden Markov Models for Couples of Letters Applied to Handwriting Recognition (XD, EA), pp. 618–621.

ICDAR-2003-El-NasanVN #n-gram #recognition #using

Handwriting Recognition Using Position Sensitive Letter N-Gram Matching (AEN, SV, GN), p. 577–?.

ICDAR-2003-SutantoLP #analysis #consistency #documentation

Study of the Consistency of Some Discriminatory Features Used by Document Examiners in the Analysis of Handwritten Letter “a” (PJS, GL, VP), pp. 1091–1095.

PADL-2003-LammelV

A Strafunski Application Letter (RL, JV), pp. 357–375.

STOC-2002-GolinKY

Huffman coding with unequal letter costs (MJG, CK, NEY), pp. 785–791.

ICDAR-2001-Breuel #algorithm #programming #segmentation #string #using

Segmentation of Handprinted Letter Strings Using a Dynamic Programming Algorithm (TMB), pp. 821–826.

ICDAR-2001-KieningerD #recognition

Applying the T-Recs Table Recognition System to the Business Letter Domain (TK, AD), pp. 518–522.

DLT-2001-Cachat #power of

The Power of One-Letter Rational Languages (TC), pp. 145–154.

DLT-2001-GlasserS

Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets (CG, HS), pp. 251–261.

ICDAR-1999-LuSWR #implementation #recognition #segmentation

An Implementation of Postal Numerals Segmentation and Recognition System for Chinese Business Letters (YL, PS, JW, JR), pp. 725–728.

ICDAR-1997-HennigSW #fuzzy #online #using

Recognizing Letters in on-line Handwriting using Hierarchical Fuzzy Inference (AH, NS, RJW), pp. 936–940.

ICDAR-1997-MiledOCL #markov #recognition

Coupling observation/letter for a Markovian modelisation applied to the recognition of Arabic handwriting (HM, CO, MC, YL), pp. 580–583.

ICDAR-v2-1995-WehbiOLP #recognition #segmentation

Numeral characters and capital letters segmentation recognition in mixed handwriting context (HW, HO, JL, EP), pp. 878–881.

ICALP-1995-GolinR #algorithm #programming

A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs (MJG, GR), pp. 256–267.

ICALP-1994-GolinY #word

Prefix Codes: Equiprobable Words, Unequal Letter Costs (MJG, NEY), pp. 605–617.

ICDAR-1993-ConsortiCI #automation

Automatic lettering of cadastral maps (VC, LPC, MI), pp. 129–132.

ICDAR-1993-TsuruokaKMSC #recognition #segmentation

Segmentation and recognition for handwritten 2-letter state names (ST, FK, YM, MS, ZC), pp. 814–817.

ICALP-1992-Keranen

Abelian Squares are Avoidable on 4 Letters (VK), pp. 41–52.

ICALP-1978-AltenkampM #named

Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract) (DA, KM), pp. 15–25.