2703 search results - page 123 / 541 » Optimizing memory transactions |
FLOPS
2006
Springer
14 years 17 days 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
13 years 10 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
13 years 8 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...
CODES
2001
IEEE
14 years 16 days ago
2001
IEEE
Compiler technology is becoming a key component in the design of embedded systems, mostly due to increasing participation of software in the design process. Meeting system-level ob...
MICRO
2007
IEEE
14 years 3 months ago
2007
IEEE
Snoopy cache coherence can be implemented in any physical network topology by embedding a logical unidirectional ring in the network. Control messages are forwarded using the ring...