1007 search results - page 22 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
ICCMS
2009
14 years 9 months ago
2009
The simulation of chemical reacting systems is one of the most challenging topics in Systems Biology, due to their complexity and inherent randomness. The Gillespie's Stochas...
CODES
1996
IEEE
15 years 3 months ago
1996
IEEE
The partitioning of image processing algorithms with a novel hardware/software co-designframework (CoDe-X) is presented in this paper, where a new Xputer-architecture (parallel Ma...
101
click to vote
SIGMOD
2011
ACM
14 years 2 months ago
2011
ACM
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
ANCS
2005
ACM
15 years 5 months ago
2005
ACM
Network edge packet-processing systems, as are commonly implemented on network processor platforms, are increasingly required to support a rich set of services. These multi-servic...
115
click to vote
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...