526 search results - page 12 / 106 » Increments of Random Partitions |
MASCOTS
2003
13 years 8 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We consider the problem of partitioning n integers chosen randomly between 1 and 2m into two subsets such that the discrepancy, the absolute value of the difference of their sums,...
IJON
2007
13 years 7 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
RSA
2010
13 years 5 months ago
2010
We study thresholds for Ramsey properties of random discrete structures. In particular, we determine the threshold for Rado’s theorem for solutions of partition regular systems o...