Sciweavers

837 search results - page 33 / 168
» Distributed RAID - A New Multiple Copy Algorithm
Sort
View
KDD
2001
ACM
163views Data Mining» more  KDD 2001»
14 years 9 months ago
The "DGX" distribution for mining massive, skewed data
Skewed distributions appear very often in practice. Unfortunately, the traditional Zipf distribution often fails to model them well. In this paper, we propose a new probability di...
Zhiqiang Bi, Christos Faloutsos, Flip Korn
SENSYS
2003
ACM
14 years 2 months ago
Matching data dissemination algorithms to application requirements
A distinguishing characteristic of wireless sensor networks is the opportunity to exploit characteristics of the application at lower layers. This approach is encouraged by device...
John S. Heidemann, Fabio Silva, Deborah Estrin
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 3 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
CLUSTER
2006
IEEE
14 years 3 months ago
Matrix Multiplication on Two Interconnected Processors
This paper presents a new partitioning algorithm to perform matrix multiplication on two interconnected heterogeneous processors. Data is partitioned in a way which minimizes the ...
Brett A. Becker, Alexey L. Lastovetsky
MOBIHOC
2002
ACM
14 years 8 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder