524 search results - page 53 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
ALGORITHMICA
2010
13 years 8 months ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
VTC
2010
IEEE
13 years 6 months ago
2010
IEEE
— In this work, we proposed a reliability-based enhancement for the Viterbi and the optimal decoding of the convolutional tailbiting codes (CTBC) from the observations that the d...