Sciweavers

1089 search results - page 96 / 218
» Randomness and Reducibility
Sort
View
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 11 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
MIDDLEWARE
2005
Springer
15 years 11 months ago
Frugal Event Dissemination in a Mobile Environment
Abstract. This paper describes an event dissemination algorithm that impletopic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is...
Sébastien Baehni, Chirdeep Singh Chhabra, R...
UC
2005
Springer
15 years 11 months ago
Quantum Searching Amidst Uncertainty
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
Lov K. Grover
EUROCRYPT
2004
Springer
15 years 11 months ago
Sequential Aggregate Signatures from Trapdoor Permutations
An aggregate signature scheme (recently proposed by Boneh, Gentry, Lynn, and Shacham) is a method for combining n signatures from n different signers on n different messages int...
Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Ho...
INDOCRYPT
2004
Springer
15 years 11 months ago
Information Theory and the Security of Binary Data Perturbation
Random data perturbation (RDP) has been in use for several years in statistical databases and public surveys as a means of providing privacy to individuals while collecting informa...
Poorvi L. Vora