45 search results - page 9 / 9 » On Non-Polynomial Latin Squares |
FSE
2005
Springer
13 years 11 months ago
2005
Springer
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ≤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...
IJCAI
2001
13 years 7 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
JCM
2008
13 years 5 months ago
2008
Abstract-- Secure group key distribution and efficient rekeying is one of the most challenging security issues in sensor networks at present. In this paper, Latin square is firstly...
BMCBI
2007
13 years 5 months ago
2007
Background: Used alone, the MAS5.0 algorithm for generating expression summaries has been criticized for high False Positive rates resulting from exaggerated variance at low inten...
BIBE
2007
IEEE
14 years 2 days ago
2007
IEEE
Abstract. Currently, the method most used for gene detection calls on Affymetrix oligonucleotide arrays is provided as part of the MAS5.0 software. The MAS method uses Wilcoxon sta...