Results 1 - 10 of 2,112

Software transactional memory for dynamic-sized data structures

by Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III - IN PROCEEDINGS OF THE 22ND ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING , 2003
"... We propose a new form of software transactional memory (STM) designed to support dynamic-sized data structures, and we describe a novel non-blocking implementation. The non-blocking property we consider is obstruction-freedom. Obstruction-freedom is weaker than lock-freedom; as a result, it admits s ..."
Abstract - Cited by 432 (25 self) - Add to MetaCart
We propose a new form of software transactional memory (STM) designed to support dynamic-sized data structures, and we describe a novel non-blocking implementation. The non-blocking property we consider is obstruction-freedom. Obstruction-freedom is weaker than lock-freedom; as a result, it admits

On the newsboy model with a cuto transaction size

by R. Dekker, J. B. G. Frenk, M. J. Kleijn, A. G. De Kok , 1998
"... In this paper we analyse the eect of a cuto transaction size on the average inventory cost in a simple newsboy setting. It is assumed that customers with an order larger than a prespecified cuto transaction size are satisfied in an alternative way, against additional cost. For compound Poisson dem ..."
Abstract - Add to MetaCart
In this paper we analyse the eect of a cuto transaction size on the average inventory cost in a simple newsboy setting. It is assumed that customers with an order larger than a prespecified cuto transaction size are satisfied in an alternative way, against additional cost. For compound Poisson

Fast Algorithms for Mining Association Rules

by Rakesh Agrawal, Ramakrishnan Srikant , 1994
"... We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Empirical evaluation shows that these algorithms outperform the known a ..."
Abstract - Cited by 3612 (15 self) - Add to MetaCart
with the number of transactions. AprioriHybrid also has excellent scale-up properties with respect to the transaction size and the number of items in the database.

Mining Sequential Patterns: Generalizations and Performance Improvements

by Ramakrishnan Srikant, Rakesh Agrawal - RESEARCH REPORT RJ 9994, IBM ALMADEN RESEARCH , 1995
"... The problem of mining sequential patterns was recently introduced in [3]. We are given a database of sequences, where each sequence is a list of transactions ordered by transaction-time, and each transaction is a set of items. The problem is to discover all sequential patterns with a user-specified ..."
Abstract - Cited by 759 (5 self) - Add to MetaCart
The problem of mining sequential patterns was recently introduced in [3]. We are given a database of sequences, where each sequence is a list of transactions ordered by transaction-time, and each transaction is a set of items. The problem is to discover all sequential patterns with a user

Data Preparation for Mining World Wide Web Browsing Patterns

by Robert Cooley, Bamshad Mobasher, Jaideep Srivastava - KNOWLEDGE AND INFORMATION SYSTEMS , 1999
"... The World Wide Web (WWW) continues to grow at an astounding rate in both the sheer volume of tra#c and the size and complexity of Web sites. The complexity of tasks such as Web site design, Web server design, and of simply navigating through a Web site have increased along with this growth. An i ..."
Abstract - Cited by 567 (43 self) - Add to MetaCart
The World Wide Web (WWW) continues to grow at an astounding rate in both the sheer volume of tra#c and the size and complexity of Web sites. The complexity of tasks such as Web site design, Web server design, and of simply navigating through a Web site have increased along with this growth

Virtualizing Transactional Memory

by Ravi Rajwar, et al. , 2005
"... Writing concurrent programs is difficult because of the complexity of ensuring proper synchronization. Conventional lock-based synchronization suffers from wellknown limitations, so researchers have considered nonblocking transactions as an alternative. Recent hardware proposals have demonstrated ho ..."
Abstract - Cited by 337 (3 self) - Add to MetaCart
how transactions can achieve high performance while not suffering limitations of lock-based mechanisms. However, current hardware proposals require programmers to be aware of platform-specific resource limitations such as buffer sizes, scheduling quanta, as well as events such as page faults

An efficient algorithm for mining association rules in large databases

by Ashok Savasere, Edward Omiecinski, Shamkant Navathe , 1995
"... Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an effi-cient algorithm for mining association rules that is fundamentally different from known al-gorithms. Compared to previous ..."
Abstract - Cited by 437 (0 self) - Add to MetaCart
Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an effi-cient algorithm for mining association rules that is fundamentally different from known al-gorithms. Compared

The Effect of Transaction Size on Offthe-Run Treasury Prices, Working Paper

by David F. Babbel, Craig B. Merrill, Mark F. Meyer, Meiring De Villiers, David F. Babbel, Craig B. Merrill, Associate Professor, Mark F. Meyer , 2001
"... and Lou Barash for helpful suggestions on econometric techniques used in this study. The authors take full responsibility for any errors contained in this document. The Effect of Transaction Size on Off-the-Run Treasury Prices A price pressure effect is implied by segmentation in the market for a se ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
and Lou Barash for helpful suggestions on econometric techniques used in this study. The authors take full responsibility for any errors contained in this document. The Effect of Transaction Size on Off-the-Run Treasury Prices A price pressure effect is implied by segmentation in the market for a

Approximate Frequency Counts over Data Streams

by Gurmeet Singh Manku, Rajeev Motwani - VLDB , 2002
"... We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. Although the output is approximate, the error is guaranteed not to exceed a user-specified parameter. Our algorithms can e ..."
Abstract - Cited by 418 (1 self) - Add to MetaCart
easily be deployed for streams of singleton items like those found in IP network monitoring. We can also handle streams of variable sized sets of items exemplified by a sequence of market basket transactions at a retail store. For such streams, we describe an optimized implementation to compute frequent

Competition in two-sided markets

by Mark Armstrong - The MITRE Corporation , 1989
"... Many markets involve two groups of agents who interact via “platforms, ” where one group’s benefit from joining a platform depends on the size of the other group that joins the platform. I present three models of such markets: a monopoly platform; a model of competing platforms where agents join a s ..."
Abstract - Cited by 374 (2 self) - Add to MetaCart
Many markets involve two groups of agents who interact via “platforms, ” where one group’s benefit from joining a platform depends on the size of the other group that joins the platform. I present three models of such markets: a monopoly platform; a model of competing platforms where agents join a
Results 1 - 10 of 2,112