1034 search results - page 185 / 207 » Wide Classes |
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
ACSAC
2007
IEEE
14 years 1 months ago
2007
IEEE
Understanding security bugs in a vulnerable program is a non-trivial task, even if the target program is known to be vulnerable. Though there exist debugging tools that facilitate...
P2P
2007
IEEE
14 years 1 months ago
2007
IEEE
Structured overlay networks form a major class of peerto-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-s...
CIVR
2007
Springer
14 years 1 months ago
2007
Springer
In the past, quantized local descriptors have been shown to be a good base for the representation of images, that can be applied to a wide range of tasks. However, current approac...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...