50 search results - page 5 / 10 » Dynamic Programming and Fast Matrix Multiplication |
IDMS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In this paper, we propose static and dynamic server selection techniques for multicast receivers who receive multiple streams from replicated servers. In the proposed sta...
PODS
2002
ACM
14 years 7 months ago
2002
ACM
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
MPC
2010
Springer
13 years 11 months ago
2010
Springer
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
SP
2009
IEEE
14 years 2 months ago
2009
IEEE
We defeat two proposed Unix file-system race condition defense mechanisms. First, we attack the probabilistic defense mechanism of Tsafrir, et al., published at USENIX FAST 2008[...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...