Sciweavers

1855 search results - page 49 / 371
» A coding theorem for distributed computation
Sort
View
P2P
2008
IEEE
137views Communications» more  P2P 2008»
14 years 5 months ago
Hierarchical Codes: How to Make Erasure Codes Attractive for Peer-to-Peer Storage Systems
Redundancy is the basic technique to provide reliability in storage systems consisting of multiple components. A redundancy scheme defines how the redundant data are produced and...
Alessandro Duminuco, Ernst Biersack
ISTA
2003
14 years 11 days ago
Managing Business Logic with Symbolic Computation
: A new approach of building enterprise distributed applications for layer of business rules as standard part of architecture is proposed in this paper. The approach uses symbolic ...
Ruslan Shevchenko, Anatoly E. Doroshenko
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
14 years 5 months ago
Poly-logarithmic Independence Fools AC0 Circuits
We prove that poly-sized AC0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan...
Mark Braverman
DAGSTUHL
2008
14 years 13 days ago
The Grand Challenges and Myths of Neural-Symbolic Computation
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
Luís C. Lamb
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
14 years 5 months ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada