524 search results - page 43 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
SPAA
1995
ACM
13 years 11 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—This paper is about designing optimal highthroughput hashing schemes that minimize the total number of memory accesses needed to build and access an hash table. Recent s...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...