Sciweavers

6181 search results - page 621 / 1237
» Transactional Cluster Computing
Sort
View
DBA
2006
182views Database» more  DBA 2006»
15 years 8 months ago
Matrix Apriori: Speeding Up the Search for Frequent Patterns
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
Judith Pavón, Sidney Viana, Santiago G&oacu...
APPINF
2003
15 years 8 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
UAI
2000
15 years 8 months ago
Nash Convergence of Gradient Dynamics in General-Sum Games
Multi-agent games are becoming an increasingly prevalent formalism for the study of electronic commerceand auctions. The speed at which transactions can take place and the growing...
Satinder P. Singh, Michael J. Kearns, Yishay Manso...
230
Voted
AEI
2007
119views more  AEI 2007»
15 years 7 months ago
Exploring the CSCW spectrum using process mining
Process mining techniques allow for extracting information from event logs. For example, the audit trails of a workflow management system or the transaction logs of an enterprise ...
Wil M. P. van der Aalst
206
Voted
ARC
2011
Springer
220views Hardware» more  ARC 2011»
15 years 2 months ago
From Plasma to BeeFarm: Design Experience of an FPGA-Based Multicore Prototype
Abstract. In this paper, we take a MIPS-based open-source uniprocessor soft core, Plasma, and extend it to obtain the Beefarm infrastructure for FPGA-based multiprocessor emulation...
Nehir Sönmez, Oriol Arcas, Gokhan Sayilar, Os...