12301 search results - page 1917 / 2461 » Distributed Computation in Dynamic Networks |
232
Voted
DIALM
2007
ACM
15 years 10 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
186
click to vote
CCS
2010
ACM
15 years 7 months ago
2010
ACM
Securing wireless sensor networks against node capture is a challenging task. All well-known random key pre-distribution systems, including the Eschenauer and Gligor's pionee...
160
click to vote
SIGMETRICS
2008
ACM
15 years 6 months ago
2008
ACM
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
179
Voted
HIPC
2007
Springer
16 years 25 days ago
2007
Springer
- With the increased complexity of platforms coupled with data centers’ servers sprawl, power consumption is reaching unsustainable limits. Memory is an important target for plat...
169
click to vote
IPPS
2006
IEEE
16 years 21 days ago
2006
IEEE
There are many application classes where the users are flexible with respect to the output quality. At the same time, there are other constraints, such as the need for real-time ...