Sciweavers

9842 search results - page 1485 / 1969
» Problem complexity
Sort
View
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
15 years 8 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
ECIS
2004
15 years 8 months ago
Adverse Events in Hospitals: The Contribution of Poor Information Systems
Adverse events in hospitals, events in which harm results to a person receiving health care, are well documented (Wilson 1995, Hepler 2001). However, while factors such as lack of...
Reeva M. Lederman
CSREAESA
2003
15 years 8 months ago
Common Mistakes in Adiabatic Logic Design and How to Avoid Them
Most so-called “adiabatic” digital logic circuit families reported in the low-power design literature are actually not truly adiabatic, in that they do not satisfy the general...
Michael P. Frank
PDPTA
2004
15 years 8 months ago
Efficient Disk Replacement and Data Migration Algorithms for Large Disk Subsystems
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
Roger Zimmermann, Beomjoo Seo
IJCAI
2003
15 years 8 months ago
Towards Cooperative Negotiation for Decentralized Resource Allocation in Autonomic Computing Systems
Resource allocation is a key problem in autonomic computing. In this paper we use a data center scenario to motivate the need for decentralization and cooperative negotiation, and...
Craig Boutilier, Rajarshi Das, Jeffrey O. Kephart,...
« Prev « First page 1485 / 1969 Last » Next »