6142 search results - page 141 / 1229 » The Complexity of Partition Functions |
129
click to vote
ISCAPDCS
2001
15 years 4 months ago
2001
Known parallel DBMS offer at present only static partitioning schemes. Adding a storage node is then a cumbersome operation that typically requires the manual data redistribution....
120
Voted
ICSE
2009
IEEE-ACM
15 years 1 months ago
2009
IEEE-ACM
Aerospace systems have strict dependability and real-time requirements, as well as a need for flexible resource reallocation and reduced size, weight and power consumption. To cope...
89
Voted
EJC
2007
15 years 3 months ago
2007
We prove a conjecture of F. Chapoton relating certain enumerative invariants of (a) the cluster complex associated by S. Fomin and A. Zelevinsky with a finite root system and (b)...
114
Voted
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
135
click to vote
WG
2005
Springer
15 years 8 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...