Sciweavers

2376 search results - page 122 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
ISCC
2002
IEEE
131views Communications» more  ISCC 2002»
14 years 23 days ago
Scheduling real time parallel structure on cluster computing
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
Reda A. Ammar, Abdulrahman Alhamdan
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
13 years 11 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
AUSAI
2001
Springer
13 years 11 months ago
Further Pruning for Efficient Association Rule Discovery
The Apriori algorithm's frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent item...
Songmao Zhang, Geoffrey I. Webb
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
13 years 10 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
ANTS
2006
Springer
101views Algorithms» more  ANTS 2006»
13 years 11 months ago
High Security Pairing-Based Cryptography Revisited
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We ...
Robert Granger, Dan Page, Nigel P. Smart