2168 search results - page 293 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
146
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
151
Voted
SAC
2006
ACM
15 years 10 months ago
2006
ACM
In a recent work, we have shown that it is not possible to dependably build any type of distributed f fault or intrusiontolerant system under the asynchronous model. This result f...
146
click to vote
MOBISYS
2010
ACM
15 years 6 months ago
2010
ACM
WiFi radios in smart-phones consume a significant amount of power when active. The 802.11 standard allows these devices to save power through an energy-conserving Power Save Mode ...
157
click to vote
MOBIHOC
2004
ACM
16 years 3 months ago
2004
ACM
Transmission power control (TPC) has a great potential to increase the throughput of a mobile ad hoc network (MANET). Existing TPC schemes achieve this goal by using additional ha...
146
click to vote
HIPC
2005
Springer
15 years 9 months ago
2005
Springer
With the increasing programmability of GPUs (graphics processing units), these units are emerging as an attractive computing platform not only for traditional graphics computation ...