16 search results - page 1 / 4 » Random partitions with restricted part sizes |
RSA
2008
13 years 10 months ago
2008
: ForasubsetS ofpositiveintegerslet (n, S)bethesetofpartitionsofnintosummands that are elements of S. For every (n, S), let Mn() be the number of parts, with multiplicity, that ...
JCO
2006
13 years 11 months ago
2006
Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned ni numbers with ni lying in a given range. The goal is to maximize a Schur con...
ALT
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. Three simple and explicit procedures for testing the independence of two multi-dimensional random variables are described. Two of the associated test statistics (L1, log-...
COMBINATORICS
2007
13 years 11 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...