Results 261 to 270 of about 3,425,301 (304)
Some of the next articles are maybe not open access.
On coding for secure computing
2015 IEEE International Symposium on Information Theory (ISIT), 2015In information theoretically secure multiparty computation, several mutually distrusting users want to jointly compute a function of their private data such that users do not learn any additional information about other users' data other than what they can infer from their own data and the function value they compute.
Deepesh Data, Vinod M. Prabhakaran
openaire +2 more sources
Computer Coding of Configuration
Journal of Chemical Information and Computer Sciences, 1996A program is described that accepts graphics input to a computer of conventional 2D representations of stereoisomers and makes configurational assignments. The present version of the program handles asymmetric carbon, sulfur, and phosphorus atoms and isomerism at double bonds.
openaire +1 more source
Code mobility for pervasive computing
13th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2005In this paper we isolate and implement the minimal functionalities for an open platform supporting mobile code. The use of the platform is discussed in the context of pervasive and ubiquitous computing. We also present a calculus for modelling mobile applications.
Flavio Corradini +2 more
openaire +3 more sources
2010 IEEE Information Theory Workshop, 2010
A locally testable code allows one to store vast amounts of data, where estimating the fraction of errors in the data takes roughly as much time as takes to read one bit of the data! If the fraction of errors is below a certain threshold, a locally decodeable code would allow one to recover every bit of the original message, again, in time which is ...
openaire +2 more sources
A locally testable code allows one to store vast amounts of data, where estimating the fraction of errors in the data takes roughly as much time as takes to read one bit of the data! If the fraction of errors is below a certain threshold, a locally decodeable code would allow one to recover every bit of the original message, again, in time which is ...
openaire +2 more sources
Computing Linear Codes and Unitals
Designs, Codes and Cryptography, 1998A unital on \(q^3+1\) points is a 2-\((q^3+1,q+1,1)\) design. The Ree unital \(R(q)\) on \(q^3+1\) points for \(q=3^{2m+1}\), \(m\geq 0\) is a design invariant under the Ree group. In 1981, Andries Brouwer constructed 138 nonisomorphic 2-\((28,42,1)\) designs and made the conjecture that the Ree unital \(R(3)\) is characterized by the fact that its ...
David B. Jaffe, Vladimir D. Tonchev
openaire +2 more sources
From channel codes to computation codes
2012 IEEE Information Theory Workshop, 2012In this paper, it is shown that a computation code exists for a stationary and d-continuous noisy computation if a channel code exists for the “virtual” channel linking the expected result of the perfect computation and the actual result given by the noisy computation. This proves the possibility to built an efficient computation code from an efficient
openaire +2 more sources
A Computer Data Base for Information on Cancer Treatment
Ca-A Cancer Journal for Clinicians, 1987Vincent T Devita
exaly