2924 search results - page 142 / 585 » Lower Bounds in Distributed Computing |
127
click to vote
MFCS
2009
Springer
15 years 5 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
128
click to vote
SPAA
2009
ACM
15 years 7 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
103
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
105
click to vote
WADS
2005
Springer
15 years 6 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
136
click to vote
WIOPT
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...