Results 1  10
of
5,259
Research Article Motion Control of Robots Using a Chaotic Truly Random Bits Generator
, 2012
"... This work introduces chaotic motion control of mobile or humanoid robots, in order to cover a terrain. The proposed method, in order to achieve complete coverage of the entire terrain, is based on a truly random bits generator. This generator is created by a nonlinear circuit, which produces double ..."
Abstract
 Add to MetaCart
This work introduces chaotic motion control of mobile or humanoid robots, in order to cover a terrain. The proposed method, in order to achieve complete coverage of the entire terrain, is based on a truly random bits generator. This generator is created by a nonlinear circuit, which produces double
Coin flipping from a cosmic source: On error correction of truly random bits
, 2002
"... We study a new problem related to coin flipping, coding theory, and noise sensitivity. Consider a source of truly random bits x ∈ {0, 1}^n, and k parties, who have noisy versions of the source bits y^i ∈ {0, 1}^n, where for all i and j, it holds that P[y j = x j ] = 1  &epsilo ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
We study a new problem related to coin flipping, coding theory, and noise sensitivity. Consider a source of truly random bits x ∈ {0, 1}^n, and k parties, who have noisy versions of the source bits y^i ∈ {0, 1}^n, where for all i and j, it holds that P[y j = x j ] = 1  &
Random Early Detection Gateways for Congestion Avoidance.
 IEEELACM Transactions on Networking,
, 1993
"... AbstractThis paper presents Random Early Detection (RED) gateways for congestion avoidance in packetswitched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract

Cited by 2716 (31 self)
 Add to MetaCart
AbstractThis paper presents Random Early Detection (RED) gateways for congestion avoidance in packetswitched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving
Randomness is Linear in Space
 Journal of Computer and System Sciences
, 1993
"... We show that any randomized algorithm that runs in space S and time T and uses poly(S) random bits can be simulated using only O(S) random bits in space S and time T poly(S). A deterministic simulation in space S follows. Of independent interest is our main technical tool: a procedure which extracts ..."
Abstract

Cited by 242 (20 self)
 Add to MetaCart
extracts randomness from a defective random source using a small additional number of truly random bits. 1
The capacity of wireless networks
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2000
"... When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally p ..."
Abstract

Cited by 3243 (42 self)
 Add to MetaCart
When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally
High performance scalable image compression with EBCOT
 IEEE Trans. Image Processing
, 2000
"... A new image compression algorithm is proposed, based on independent Embedded Block Coding with Optimized Truncation of the embedded bitstreams (EBCOT). The algorithm exhibits stateoftheart compression performance while producing a bitstream with a rich feature set, including resolution and SNR ..."
Abstract

Cited by 586 (11 self)
 Add to MetaCart
A new image compression algorithm is proposed, based on independent Embedded Block Coding with Optimized Truncation of the embedded bitstreams (EBCOT). The algorithm exhibits stateoftheart compression performance while producing a bitstream with a rich feature set, including resolution and SNR
Proof verification and hardness of approximation problems
 IN PROC. 33RD ANN. IEEE SYMP. ON FOUND. OF COMP. SCI
, 1992
"... We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probabilit ..."
Abstract

Cited by 797 (39 self)
 Add to MetaCart
We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts
High confidence visual recognition of persons by a test of statistical independence
 IEEE TRANS. ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a sample of the ..."
Abstract

Cited by 621 (8 self)
 Add to MetaCart
of the human population reveals variation corresponding to several hundred independent degreesoffreedom. Morphogenetic randomness in the texture expressed phenotypically in the iris trabecular meshwork ensures that a test of statistical independence on two coded patterns originating from different eyes
Hardness vs. randomness
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1994
"... We present a simple new construction of a pseudorandom bit generator, based on the constant depth generators of [N]. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (eg P, NC, PSPACE,...) using an arbitrary function tha ..."
Abstract

Cited by 298 (27 self)
 Add to MetaCart
We present a simple new construction of a pseudorandom bit generator, based on the constant depth generators of [N]. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (eg P, NC, PSPACE,...) using an arbitrary function
Interprocedural dataflow analysis via graph reachability
, 1994
"... The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow fun ..."
Abstract

Cited by 454 (34 self)
 Add to MetaCart
functions must distribute over the confluence operator (either union or intersection). This class of problems includes—but is not limited to—the classical separable problems (also known as “gen/kill ” or “bitvector” problems)—e.g., reaching definitions, available expressions, and live variables
Results 1  10
of
5,259