Results 241 to 250 of about 3,601,239 (277)
Some of the next articles are maybe not open access.

Modern Random Access Protocols

Foundations and Trends® in Networking, 2016
Random access represents possibly the simplest and yet one of the best known approaches for sharing a channel among several users. Since their introduction in the 1970s, random access schemes have been thoroughly studied and small variations of the pioneering Aloha protocol have since then become a key component of many communications standards ...
Matteo Berioli   +3 more
openaire   +1 more source

Random Access

Journal of Visual Impairment & Blindness, 1985
This new monthly section highlights the impact of technological development on consumers and the blindness/visual impairment field. We need your support. Please send news, reviews, and descriptions of new hardware, software, interfacing ideas, prototypes, training programs, job opportunities, volunteer usage, user evaluations, educational ...
openaire   +1 more source

On Random-Access Data Compaction

Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253), 2000
Consider a binary lID. sequence that consists of K = 2’ blocks of length T. We are looking for a universal compaction method that allows us to decode a certain block by looking only at certain segments in the codesequence. We have investigated a hierarchical method that encodes the source sequence into a codesequence that consists of 2~+1 variable ...
Willems, F.M.J.   +2 more
openaire   +2 more sources

Broadcast stability in random access

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005
We introduce and study the problem of broadcast stability in a network where nodes utilize the ALOHA protocol to gain random access to the channel. We make use of the dominating systems argument used in previous works and also develop a novel method for finding the region of stable arrival rates of packets. The stability region is obtained by analyzing
Brooke Shrader, Anthony Ephremides
openaire   +1 more source

Quantum Random Access Coding

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2009
Quantum random access coding (QRAC) is one of the basic tools in quantum computing. It uses a quantum state for encoding the sender's bit string so that the receiver can recover any single bit of the bit string with high probability. This article surveys recent developments of QRAC, with some concrete examples of QRAC using one quantum bit, and its ...
Harumichi Nishimura, Rudy Raymond
openaire   +1 more source

Random Access

2021
Erik Dahlman   +2 more
openaire   +1 more source

Improving the access time for random access files

Communications of the ACM, 1977
Clustering in the key set is decreased by smoothing the key-to-address transformation, and by adding shadow buckets to an open chaining file. The keys are pre-hashed before the address division, to remove the effect of sequential properties in the key set. Shadow buckets in the key search sequence reduce the effect of nonuniformity in file loading, and
openaire   +2 more sources

Random Access

Journal of Visual Impairment & Blindness, 1986
A monthly section highlighting the impact of technological development on consumers and the blindness/visual impairment field. We need your support. Please send news, reviews, and descriptions of new hardware, software, interfacing ideas, prototypes, training programs, job opportunities, volunteer usage, user evaluations, educational opportunities ...
openaire   +1 more source

Ferroelectric Random Access Memories

Journal of Nanoscience and Nanotechnology, 2012
Ferroelectric random access memory (FeRAM) is a nonvolatile memory, in which data are stored using hysteretic P-E (polarization vs. electric field) characteristics in a ferroelectric film. In this review, history and characteristics of FeRAMs are first introduced. It is described that there are two types of FeRAMs, capacitor-type and FET-type, and that
openaire   +2 more sources

A perspective on massive random-access

2017 IEEE International Symposium on Information Theory (ISIT), 2017
This paper discusses the contemporary problem of providing multiple-access (MAC) to a massive number of uncoordinated users. First, we define a random-access code for Ka-user Gaussian MAC to be a collection of norm-constrained vectors such that the noisy sum of any K a of them can be decoded with a given (suitably defined) probability of error.
openaire   +1 more source

Home - About - Disclaimer - Privacy