631 search results - page 79 / 127 » Composable memory transactions |
FLOPS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell's implementation of s...
FIMI
2003
14 years 11 months ago
2003
We will discuss , the depth first implementation of APRIORI as devised in 1999 (see [8]). Given a database, this algorithm builds a trie in memory that contains all frequent item...
IDA
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
ASPDAC
2008
ACM
14 years 11 months ago
2008
ACM
Since 2001, there have been a myriad of papers on systematic analysis of Multi-Processor System on Chip (MPSoC) and Network on Chip (NoC). Nevertheless, we only have a few of their...
SIGMOD
1997
ACM
15 years 1 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...