872 search results - page 156 / 175 » Extreme lower probabilities |
120
Voted
ADHOCNOW
2004
Springer
15 years 2 months ago
2004
Springer
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threat...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
DCC
2000
IEEE
15 years 1 months ago
2000
IEEE
Multiple description codes are data compression algorithms designed with the goal of minimizing the distortion caused by data loss in packet-based or diversity communications syst...
INFOCOM
2000
IEEE
15 years 1 months ago
2000
IEEE
Abstract—Virtual Private Networks (VPN) and link sharing are cost effective way of realizing corporate intranets. Corporate intranets will increasingly have to provide Integrated...
CRYPTO
2000
Springer
15 years 1 months ago
2000
Springer
We present a chosen-ciphertext attack against the public key cryptosystem called NTRU. This cryptosystem is based on polynomial algebra. Its security comes from the interaction of ...