2168 search results - page 296 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
137
click to vote
PODC
2005
ACM
15 years 9 months 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...
138
click to vote
WABI
2007
Springer
15 years 10 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...
151
click to vote
PODS
2008
ACM
16 years 4 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 ...
140
click to vote
WS
2004
ACM
15 years 9 months 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 ...
151
click to vote
AUTONOMICS
2008
ACM
15 years 5 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...