127 search results - page 11 / 26 » Acyclic dominating partitions |
DOLAP
1998
ACM
13 years 11 months ago
1998
ACM
Star schema has been a typical model for both online transaction processing in traditional databases and online analytical processing in large data warehouses. In the star schema,...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
APCSAC
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
PDIS
1994
IEEE
13 years 11 months ago
1994
IEEE
Many parallel join algorithms have been proposed so far but most of which are developed focused on minimizing the disk It0 and CPU costs. The communication cost, however, is also ...
COMBINATORICA
2006
13 years 7 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...