581 search results - page 1 / 117 » Set partition patterns and statistics |
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
DM
2008
13 years 4 months ago
2008
A set partition is said to be (k, d)-noncrossing if it avoids the pattern 12
DEXAW
2006
IEEE
13 years 10 months ago
2006
IEEE
The effective grouping, or partitioning, of semistructured data is of fundamental importance when providing support for queries. Partitions allow items within the data set that sh...
JCT
2008
13 years 4 months ago
2008
We introduce a statistic pmaj(P) for partitions of [n], and show that it is equidistributed with cr2, the number of 2-crossings, over all partitions of [n] with given sets of mini...
MCS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...