Sciweavers

620 search results - page 15 / 124
» The computational power of population protocols
Sort
View
ASIACRYPT
2000
Springer
15 years 2 months ago
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
Danny Gutfreund, Michael Ben-Or
NCA
2003
IEEE
15 years 3 months ago
Scalable Protocol for Content-Based Routing in Overlay Networks
In content networks, messages are routed on the basis of their content and the interests (subscriptions) of the message consumers. This form of routing offers an interesting alte...
Raphaël Chand, Pascal Felber
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
15 years 2 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
MOBIHOC
2004
ACM
15 years 9 months ago
A single-channel solution for transmission power control in wireless ad hoc networks
Transmission power control (TPC) has a great potential to increase the throughput of a mobile ad hoc network (MANET). Existing TPC schemes achieve this goal by using additional ha...
Alaa Muqattash, Marwan Krunz
RECOMB
2008
Springer
15 years 10 months ago
Accounting for Non-genetic Factors Improves the Power of eQTL Studies
Abstract. The recent availability of large scale data sets profiling single nucleotide polymorphisms (SNPs) and gene expression across different human populations, has directed muc...
Oliver Stegle, Anitha Kannan, Richard Durbin, John...