Sciweavers

3047 search results - page 550 / 610
» On the Meaning of Logical Completeness
Sort
View
SAC
2006
ACM
15 years 3 months ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...
SASN
2006
ACM
15 years 3 months ago
Autonomous and distributed node recovery in wireless sensor networks
Intrusion or misbehaviour detection systems are an important and widely accepted security tool in computer and wireless sensor networks. Their aim is to detect misbehaving or faul...
Mario Strasser, Harald Vogt
IMC
2005
ACM
15 years 3 months ago
Multi-Hop Probing Asymptotics in Available Bandwidth Estimation: Stochastic Analysis
— This paper analyzes the asymptotic behavior of packet-train probing over a multi-hop network path P carrying arbitrarily routed bursty cross-traffic flows. We examine the sta...
Xiliang Liu, Kaliappa Nadar Ravindran, Dmitri Logu...
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
15 years 3 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...