321 search results - page 45 / 65 » Implementing Randomized Matrix Algorithms in Parallel and Di... |
147
Voted
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
123
click to vote
ICDCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— Distributed stream processing systems offer a highly scalable and dynamically configurable platform for time-critical applications ranging from real-time, exploratory ...
119
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
In building a real-life mobile ad-hoc network (MANET), network emulation has been appraised as an efficient approach for testing the real implementations of routing algorithms and...
138
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
112
click to vote
SPAA
1997
ACM
15 years 6 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...