154 search results - page 24 / 31 » Dependence Flow Graphs: An Algebraic Approach to Program Dep... |
WACC
1999
ACM
13 years 11 months ago
1999
ACM
Knowledge discovery in databases (KDD) is an increasingly widespread activity. KDD processes may entail the use of a large number of data manipulation and analysis techniques, and...
RTSS
1994
IEEE
13 years 11 months ago
1994
IEEE
The use of caches poses a difficult tradeoff for architects of real-time systems. While caches provide significant performance advantages, they have also been viewed as inherently...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
IPPS
2005
IEEE
14 years 28 days ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
CONCUR
2001
Springer
13 years 12 months ago
2001
Springer
It has long been recognised that standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Va...