Sciweavers

461 search results - page 24 / 93
» Letters
Sort
View
DC
2010
13 years 11 months ago
The mailbox problem
d Abstract) Marcos K. Aguilera1 , Eli Gafni1,2 , and Leslie Lamport1 1 Microsoft Research Silicon Valley 2 UCLA We propose and solve a synchronization problem called the mailbox pr...
Marcos Kawazoe Aguilera, Eli Gafni, Leslie Lamport
COMBINATORICS
2004
61views more  COMBINATORICS 2004»
13 years 10 months ago
Improved Bounds on the Length of Maximal Abelian Square-free Words
A word is abelian square-free if it does not contain two adjacent subwords which are permutations of each other. Over an alphabet k on k letters, an abelian squarefree word is max...
Evan M. Bullock
ACL
2009
13 years 8 months ago
Reducing the Annotation Effort for Letter-to-Phoneme Conversion
Letter-to-phoneme (L2P) conversion is the process of producing a correct phoneme sequence for a word, given its letters. It is often desirable to reduce the quantity of training d...
Kenneth Dwyer, Grzegorz Kondrak
ICDAR
2011
IEEE
12 years 10 months ago
Evaluating the Rarity of Handwriting Formations
—Identifying unusual or unique characteristics of an observed sample in useful in forensics in general and handwriting analysis in particular. Rarity is formulated as the probabi...
Sargur N. Srihari
FUN
2007
Springer
85views Algorithms» more  FUN 2007»
14 years 2 months ago
Efficient Algorithms for the Spoonerism Problem
A spoonerism is a sentence in some natural language where the swapping of two letters results in a new sentence with a different meaning. In this paper, we give some efficient algo...
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ri...