4850 search results - page 895 / 970 » Proof and Computation in Geometry |
112
Voted
SENSYS
2003
ACM
15 years 5 months ago
2003
ACM
Sensor networks promise viable solutions to many monitoring problems. However, the practical deployment of sensor networks faces many challenges imposed by real-world demands. Sen...
106
click to vote
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
114
Voted
ACISP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
86
Voted
CAISE
2000
Springer
15 years 5 months ago
2000
Springer
This paper presents an approach and a tool to increase specification quality by using a combination of UML and formal languages. Our approach is based on the expression of the UML ...
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...