Sciweavers

11345 search results - page 100 / 2269
» Foundations of Computer Science
Sort
View
COMPUTER
2007
103views more  COMPUTER 2007»
13 years 10 months ago
Examining the Challenges of Scientific Workflows
Workflows have recently emerged as a paradigm for representing and managing complex distributed scientific computations and therefore accelerate the pace of scientific progress. A...
Yolanda Gil, Ewa Deelman, Mark H. Ellisman, Thomas...
ICNC
2005
Springer
14 years 3 months ago
Adaptive Parallel Ant Colony Algorithm
: Two strategies for information exchange between processors in parallel ant colony algorithm are presented. Theses strategies can make each processor choose other processors to co...
Ling Chen, Chunfang Zhang
SIAMCOMP
2010
147views more  SIAMCOMP 2010»
13 years 8 months ago
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
FOCS
2005
IEEE
14 years 3 months ago
Learning mixtures of product distributions over discrete domains
We consider the problem of learning mixtures of product distributions over discrete domains in the distribution learning framework introduced by Kearns et al. [18]. We give a poly...
Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
14 years 1 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...