Sciweavers

1517 search results - page 90 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
138
Voted
AUSAI
2003
Springer
15 years 10 months ago
Efficiently Mining Frequent Patterns from Dense Datasets Using a Cluster of Computers
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
Yudho Giri Sucahyo, Raj P. Gopalan, Amit Rudra
152
Voted
IPPS
2005
IEEE
15 years 10 months ago
Improvement of Power-Performance Efficiency for High-End Computing
Left unchecked, the fundamental drive to increase peak performance using tens of thousands of power hungry components will lead to intolerable operating costs and failure rates. R...
Rong Ge, Xizhou Feng, Kirk W. Cameron
CCGRID
2006
IEEE
15 years 8 months ago
Compilation of XSLT into Dataflow Graphs for Web Service Composition
Our current research into programming models for parallel web services composition is targeted at providing mechanisms for obtaining higher throughput for large scale compute and ...
Peter M. Kelly, Paul D. Coddington, Andrew L. Wend...
LION
2007
Springer
113views Optimization» more  LION 2007»
15 years 11 months ago
Limited-Memory Techniques for Sensor Placement in Water Distribution Networks
Abstract. The practical utility of optimization technologies is often impacted by factors that reflect how these tools are used in practice, including whether various real-world c...
William E. Hart, Jonathan W. Berry, Erik G. Boman,...
CLUSTER
2006
IEEE
15 years 11 months ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...