400 search results - page 35 / 80 » Lower Bounds Using Kolmogorov Complexity |
AAAI
2010
13 years 11 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
SODA
2000
ACM
13 years 11 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
TSP
2008
13 years 9 months ago
2008
Abstract-- We consider approximations of signals by the elements of a frame in a complex vector space of dimension N and formulate both the noiseless and the noisy sparse represent...
WDAG
2010
Springer
13 years 8 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...