Sciweavers

1058 search results - page 177 / 212
» It's Doomed; We Can Prove It
Sort
View
PAAPP
2007
104views more  PAAPP 2007»
13 years 9 months ago
Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
Abstract— This paper studies the WSN application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling a...
Wen-Zhan Song, Fenghua Yuan, Richard LaHusen, Behr...
SIAMCOMP
2011
13 years 4 months ago
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...
SPAA
2004
ACM
14 years 3 months ago
The effect of faults on network expansion
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary...
IH
1999
Springer
14 years 2 months ago
Hiding Signatures in Graph Coloring Solutions
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
Gang Qu, Miodrag Potkonjak
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
14 years 2 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein