Sciweavers

461 search results - page 20 / 93
» Letters
Sort
View
CHI
2002
ACM
14 years 11 months ago
Will it be upper-case or will it be lower-case: can a prompt for text be a mode signal?
The new forms of interaction being devised for small mobile devices have required designers to re-visit basic principles for user interface design. One of these is the notion of m...
Hokyoung Ryu
EMNLP
2008
14 years 11 days ago
Attacking Decipherment Problems Optimally with Low-Order N-gram Models
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
Sujith Ravi, Kevin Knight
ACL
2006
14 years 9 days ago
Unsupervised Analysis for Decipherment Problems
We study a number of natural language decipherment problems using unsupervised learning. These include letter substitution ciphers, character code conversion, phonetic deciphermen...
Kevin Knight, Anish Nair, Nishit Rathod, Kenji Yam...
DM
2006
79views more  DM 2006»
13 years 11 months ago
Restricted even permutations and Chebyshev polynomials
We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation on k letters, or containing exactly once. In sever...
Toufik Mansour
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
14 years 4 months ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev