The paper presents a novel approach to increase the performance and/or throughput of iterative belief propagation (BP) decoding of low density parity check (LDPC) codes. The propo...
Esa Alghonaim, Aiman El-Maleh, Mohamed Adnan Lando...
We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
— Three-dimensional digital terrain models are of fundamental importance in many areas such as the geo-sciences and outdoor robotics. Accurate modeling requires the ability to de...
The Iceberg-Cube problem restricts the computation of the data cube to only those group-by partitions satisfying a minimum threshold condition defined on a specified measure. In t...