Sciweavers

1578 search results - page 272 / 316
» Algorithmic randomness of continuous functions
Sort
View
JOC
2000
181views more  JOC 2000»
13 years 8 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
11 years 11 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
BMCBI
2010
110views more  BMCBI 2010»
13 years 8 months ago
TimeDelay-ARACNE: Reverse engineering of gene networks from time-course data by an information theoretic approach
Background: One of main aims of Molecular Biology is the gain of knowledge about how molecular components interact each other and to understand gene function regulations. Using mi...
Pietro Zoppoli, Sandro Morganella, Michele Ceccare...
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 8 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
ISCI
2008
159views more  ISCI 2008»
13 years 8 months ago
Large scale evolutionary optimization using cooperative coevolution
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
Zhenyu Yang, Ke Tang, Xin Yao