439 search results - page 66 / 88 » Stretching transactional memory |
FLOPS
2006
Springer
15 years 3 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
15 years 1 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...
107
click to vote
IDA
2007
Springer
14 years 11 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...
107
click to vote
SIGMOD
1997
ACM
15 years 4 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...
ITCC
2005
IEEE
15 years 5 months ago
2005
IEEE
M-commerce has shown up as e-commerce in mobile and wireless communication, and now deals with on-line banking, stock trading, auctions, transactions, and mobile media. M-commerce...