Sciweavers

6142 search results - page 141 / 1229
» The Complexity of Partition Functions
Sort
View
ISCAPDCS
2001
14 years 11 months ago
AMOS-SDDS: A Scalable Distributed Data Manager for Windows Multicomputers
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....
Yakham Ndiaye, Aly Wane Diene, Witold Litwin, Tore...
ICSE
2009
IEEE-ACM
14 years 7 months ago
Architecting Robustness and Timeliness in a New Generation of Aerospace Systems
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...
José Rufino, João Craveiro, Paulo Ve...
55
Voted
EJC
2007
14 years 10 months ago
On some enumerative aspects of generalized associahedra
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)...
Christos A. Athanasiadis
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
15 years 4 months ago
Separating Populations with Wide Data: A Spectral Analysis
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...
Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuh...
WG
2005
Springer
15 years 3 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
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...
Ross M. McConnell, Fabien de Montgolfier