597 search results - page 13 / 120 » Homomorphisms of random paths |
COMGEO
1999
ACM
14 years 9 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
DAC
2002
ACM
15 years 10 months ago
2002
ACM
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...
ISSTA
2006
ACM
15 years 3 months ago
2006
ACM
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
BROADNETS
2004
IEEE
15 years 1 months ago
2004
IEEE
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...
ACNS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally the votes. If voters can send in arbitrary ...