Results 251 to 260 of about 933,240 (306)

HV-CVD synthesis yielding B-doped SWCNTs with a constrained diameter distribution.

Chem Commun (Camb)
Denier van der Gon D, Pinna-Brito R, Liu Z, Nogueira CSC, Miyauchi Y, Pichler T, Heckl OH, Ayala P.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On information dispersal algorithms

Proceedings IEEE International Symposium on Information Theory,, 2003
An information dispersal algorithm is a method to split a file f into n pieces in such a way that the file can be reconstructed from some predefined subsets of pieces. In this paper we analyze multiple information dispersal algorithms by using an information-theoretic framework.
DE SANTIS, Alfredo, MASUCCI, Barbara
openaire   +1 more source

Asynchronous Veri.able Information Dispersal

24th IEEE Symposium on Reliable Distributed Systems (SRDS'05), 2006
Information dispersal addresses the question of storing a file by distributing it among a set of servers in a storage-efficient way. We introduce the problem of verifiable information dispersal in an asynchronous network, where up to one third of the servers as well as an arbitrary number of clients might exhibit Byzantine faults. Verifiability ensures
C. Cachin, S. Tessaro
openaire   +1 more source

Fault—tolerant hypercube broadcasting via information dispersal

Networks, 1993
AbstractBroadcasting is the process of disseminating a message originated at one node of a network to all other nodes. In this paper, we consider the problem of broadcasting reliably in the hypercube in presence of either transmission or link failures. We propose broadcasting protocols under various assumptions on the communication model.
GARGANO, Luisa, RESCIGNO, Adele Anna, VACCARO, Ugo   +2 more
openaire   +2 more sources

Asynchronous Verifiable Information Dispersal

2005
We consider the distribution of data by a client among a set of n storage servers, of which up to t might be faulty exhibiting arbitrary, i.e., Byzantine, behavior. The goal is to ensure that clients can always recover the stored data correctly, independently from the behavior of faulty servers or other, faulty clients. An inefficient solution is based
Christian Cachin, Stefano Tessaro
openaire   +1 more source

Platform competition under dispersed information [PDF]

, 2013
We study monopolistic and competitive pricing in a two-sided market where agents have incomplete information about the quality of the product provided by each platform. The analysis is carried out within a global-game framework that offers the convenience of equilibrium uniqueness while permitting the outcome of such equilibrium to depend on the ...
Bruno Jullien, Alessandro Pavan
openaire   +1 more source

Price dispersion, information and learning

Journal of Monetary Economics, 2006
Abstract We consider an economy where trade is decentralized and agents have incomplete information with respect to the value of money. Agents’ learning evolves from private experiences and we explore how the formation of prices interacts with learning.
Luis Araujo, Andrei Shevchenko
openaire   +1 more source

Information and the dispersion of posterior expectations

Journal of Economic Theory, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nikolai Brandt, Burkhard Drees, Bernhard Eckwert, Felix Várdy   +3 more
openaire   +3 more sources