Sciweavers

6181 search results - page 39 / 1237
» Transactional Cluster Computing
Sort
View
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 8 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
KAIS
2006
164views more  KAIS 2006»
13 years 8 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
ISPA
2004
Springer
14 years 1 months ago
Ensuring E-Transaction Through a Lightweight Protocol for Centralized Back-End Database
A reasonable end-to-end reliability guarantee for three-tier systems, called e-Transaction (exactly-once Transaction), has been recently proposed. This work presents a lightweight ...
Paolo Romano, Francesco Quaglia, Bruno Ciciani
MIDDLEWARE
2001
Springer
14 years 14 days ago
The CORBA Activity Service Framework for Supporting Extended Transactions
Although it has long been realised that ACID transactions by themselves are not adequate for structuring long-lived applications and much research work has been done on developing...
Iain Houston, Mark C. Little, Ian Robinson, Santos...

Publication
187views
15 years 6 months ago
A Comparison of Hashing Schemes for Address Lookup in Computer Networks - More Detailed
This is a more detailed version of the paper with the same title published in the IEEE Transactions on Communications, October 1992
R. Jain