2168 search results - page 296 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
182
click to vote
PODC
2005
ACM
16 years 13 days ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
192
click to vote
WABI
2007
Springer
16 years 1 months ago
2007
Springer
Christopher James Langmead⋆ and Sumit Kumar Jha Department of Computer Science, Carnegie Mellon University We present a novel approach for predicting protein folding kinetics us...
204
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
190
click to vote
WS
2004
ACM
16 years 9 days ago
2004
ACM
In this paper we present a man-in-the-middle attack on the Universal Mobile Telecommunication Standard (UMTS), one of the newly emerging 3G mobile technologies. The attack allows ...
222
click to vote
AUTONOMICS
2008
ACM
15 years 8 months ago
2008
ACM
A prominent functionality of a Wireless Sensor Network (WSN) is environmental monitoring. For this purpose the WSN creates a model for the real world by using abstractions to pars...