2924 search results - page 367 / 585 » Lower Bounds in Distributed Computing |
142
click to vote
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...
136
click to vote
ALENEX
2010
15 years 6 months ago
2010
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
149
click to vote
SODA
2000
ACM
15 years 6 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...
129
Voted
IVC
2007
15 years 4 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
127
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...