165 search results - page 9 / 33 » On Completing Latin Squares |
FSE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Given (deterministic) ciphers E and E that can encipher messages of l and n bits, respectively, we construct a cipher E∗ = XLS[E, E] that can encipher messages of l + s...
DATESO
2010
13 years 6 months ago
2010
Abstract. Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, i...
MOC
2002
13 years 8 months ago
2002
We answer a question left open in an article of Coppersmith and Davenport which proved the existence of polynomials whose powers are sparse, and in particular polynomials whose squ...
CVIU
1999
13 years 8 months ago
1999
We show that we can effectively fit arbitrarily complex animation models to noisy data extracted from ordinary face images Our approach is based on least-squares adjustment, using...
JCDL
2011
ACM
12 years 11 months ago
2011
ACM
We describe here a method for automatically identifying word sense variation in a dated collection of historical books in a large digital library. By leveraging a small set of kno...