Sciweavers

68 search results - page 9 / 14
» Cross-intersecting families of permutations
Sort
View
DCC
2008
IEEE
14 years 7 months ago
Homogeneous factorisations of Johnson graphs
For a graph , subgroups M < G Aut(), and an edge partition E of , the pair (, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on and fixes setwise each part...
Maria Cristeta Cuaresma, Michael Giudici, Cheryl E...
PPSN
2000
Springer
13 years 11 months ago
Using Dynastic Exploring Recombination to Promote Diversity in Genetic Search
A family of recombination operators is studied in this work. These operators are based on keeping and using certain information about the past evolution of the algorithm to guide t...
Carlos Cotta, José M. Troya
FFA
2007
56views more  FFA 2007»
13 years 7 months ago
Optical orthogonal codes and arcs in PG(d, q)
We present a new construction for (n, w, λ)-optical orthogonal codes (OOCs). The construction is pleasingly simple, where codewords correspond to arcs, specifically normal ratio...
T. L. Alderson
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
14 years 8 months ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
IVC
2007
84views more  IVC 2007»
13 years 7 months ago
A variation on SVD based image compression
We present a variation to the well studied SVD based image compression technique. Our variation can be viewed as a preprocessing step in which the input image is permuted as per a...
Abhiram G. Ranade, Srikanth S. Mahabalarao, Satyen...