Sciweavers

7 search results - page 2 / 2
» Enumeration of (k, 2)-noncrossing partitions
Sort
View
DCC
2005
IEEE
14 years 5 months ago
The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments
A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each ga...
Harri Haanpää, Petteri Kaski
EDBT
2011
ACM
256views Database» more  EDBT 2011»
12 years 9 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...