3247 search results - page 351 / 650 » Randomized smoothing networks |
187
click to vote
ISCC
2006
IEEE
16 years 21 days ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
146
click to vote
SAC
2006
ACM
16 years 19 days ago
2006
ACM
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
168
click to vote
FC
2005
Springer
16 years 6 days ago
2005
Springer
We consider defenses against confidentiality and integrity attacks on data following break-ins, or so-called intrusion resistant storage technologies. We investigate the problem o...
207
click to vote
FPGA
2000
ACM
15 years 10 months ago
2000
ACM
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
191
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Every public-key encryption scheme has to incorporate a certain amount of randomness into its ciphertexts to provide semantic security against chosen ciphertext attacks (IND-CCA). ...