Sciweavers

1631 search results - page 237 / 327
» Uniform Distributed Synthesis
Sort
View
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
15 years 9 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
KIVS
2005
Springer
15 years 8 months ago
Measuring Large Overlay Networks - The Overnet Example
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...
Kendy Kutzner, Thomas Fuhrmann
IPPS
2003
IEEE
15 years 8 months ago
RMIX: A Multiprotocol RMI Framework for Java
With the increasing adoption of Java for parallel and distributed computing, there is a strong motivation for enhancing the expressive elegance of the RMI paradigm with flexible ...
Dawid Kurzyniec, Tomasz Wrzosek, Vaidy S. Sunderam...
DMIN
2006
126views Data Mining» more  DMIN 2006»
15 years 4 months ago
Comparison and Analysis of Mutation-based Evolutionary Algorithms for ANN Parameters Optimization
Mutation-based Evolutionary Algorithms, also known as Evolutionary Programming (EP) are commonly applied to Artificial Neural Networks (ANN) parameters optimization. This paper pre...
Kristina Davoian, Alexander Reichel, Wolfram-Manfr...
135
Voted
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 2 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin