23413 search results - page 4366 / 4683 » or 2005 |
205
Voted
PODC
2005
ACM
16 years 1 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
217
click to vote
PODC
2005
ACM
16 years 1 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
202
Voted
PODS
2005
ACM
16 years 1 months ago
2005
ACM
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...
154
Voted
PPOPP
2005
ACM
16 years 1 months ago
2005
ACM
Recently, system architects have built low-power, high-performance clusters, such as Green Destiny. The idea behind these clusters is to improve the energy efficiency of nodes. H...
207
click to vote
PPOPP
2005
ACM
16 years 1 months ago
2005
ACM
As the number of processors in today’s high performance computers continues to grow, the mean-time-to-failure of these computers are becoming significantly shorter than the exe...