Sciweavers

8370 search results - page 1277 / 1674
» Challenges in P2P Computing
Sort
View
VLDB
2005
ACM
118views Database» more  VLDB 2005»
16 years 9 days ago
Mining Compressed Frequent-Pattern Sets
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
WABI
2005
Springer
143views Bioinformatics» more  WABI 2005»
16 years 9 days ago
A Faster Algorithm for Detecting Network Motifs
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
Sebastian Wernicke
WLP
2005
Springer
16 years 8 days ago
Expressing Interaction in Combinatorial Auction through Social Integrity Constraints
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
Marco Alberti, Federico Chesani, Alessio Guerri, M...
ACMICEC
2004
ACM
161views ECommerce» more  ACMICEC 2004»
16 years 7 days ago
The 2003 Supply Chain Management Trading Agent Competition
Supply Chain Management deals with the planning and coordination of bidding, production and procurement activities across the multiple organizations involved in the delivery of on...
Raghu Arunachalam, Norman M. Sadeh
CASES
2004
ACM
16 years 7 days ago
A post-compiler approach to scratchpad mapping of code
ScratchPad Memories (SPMs) are commonly used in embedded systems because they are more energy-efficient than caches and enable tighter application control on the memory hierarchy...
Federico Angiolini, Francesco Menichelli, Alberto ...
« Prev « First page 1277 / 1674 Last » Next »