Results 1  10
of
79,471
Quantum Algorithm for the Collision Problem
, 1997
"... In this note, we give a quantum algorithm that finds collisions in arbitrary rtoone functions after only O( 3 p N=r ) expected evaluations of the function. Assuming the function is given by a black box, this is more efficient than the best possible classical algorithm, even allowing probabil ..."
Abstract

Cited by 47 (1 self)
 Add to MetaCart
elements x 0 ; x 1 2 X such that F (x 0 ) = F (x 1 ). The collision problem is to find a collision in F under the promise that there is one. This problem is of particular interest for cryptology because some functions known as hash functions are used in various cryptographic protocols. The security
Quantum Lower Bound for the Collision Problem
, 2002
"... The collision problem is to decide whether a function X : . . . , n} is onetoone or twotoone, given that one of these is the case. We show a lower bound of on the number of queries needed by a quantum computer to solve this problem with bounded error probability. The best known upper bou ..."
Abstract

Cited by 68 (17 self)
 Add to MetaCart
The collision problem is to decide whether a function X : . . . , n} is onetoone or twotoone, given that one of these is the case. We show a lower bound of on the number of queries needed by a quantum computer to solve this problem with bounded error probability. The best known upper
Quantum lower bound for the collision problem
, 2003
"... We extend Shi’s 2002 quantum lower bound for collision in rtoone functions with n inputs. Shi’s bound of Ω((n/r) 1/3) is tight, but his proof applies only in the case where the range has size at least 3n/2. We give a modified version of Shi’s argument which removes this restriction. 1 ..."
Abstract

Cited by 39 (0 self)
 Add to MetaCart
We extend Shi’s 2002 quantum lower bound for collision in rtoone functions with n inputs. Shi’s bound of Ω((n/r) 1/3) is tight, but his proof applies only in the case where the range has size at least 3n/2. We give a modified version of Shi’s argument which removes this restriction. 1
The broadcast storm problem in a mobile ad hoc network
 ACM Wireless Networks
, 2002
"... Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm s ..."
Abstract

Cited by 1237 (15 self)
 Add to MetaCart
signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we refer as the broadcast storm problem. In this paper, we iden
RealTime Obstacle Avoidance for Manipulators and Mobile Robots
 INT. JOUR OF ROBOTIC RESEARCH
, 1986
"... This paper presents a unique realtime obstacle avoidance approach for manipulators and mobile robots based on the artificial potential field concept. Collision avoidance, traditionally considered a high level planning problem, can be effectively distributed between different levels of control, al ..."
Abstract

Cited by 1345 (28 self)
 Add to MetaCart
This paper presents a unique realtime obstacle avoidance approach for manipulators and mobile robots based on the artificial potential field concept. Collision avoidance, traditionally considered a high level planning problem, can be effectively distributed between different levels of control, al
A PolynomialTime Quantum Algorithm for Collision Problem
, 1997
"... In this paper, we give a quantum algorithm which solves collision problem in an expected polynomial time. Especially, when the function is twotoone, we present a quantum algorithm which can find a collision with certainty in a worstcase polynomial time. We also give a quantum algorithm which solv ..."
Abstract
 Add to MetaCart
In this paper, we give a quantum algorithm which solves collision problem in an expected polynomial time. Especially, when the function is twotoone, we present a quantum algorithm which can find a collision with certainty in a worstcase polynomial time. We also give a quantum algorithm which
ABSTRACT Quantum Lower Bound for the Collision Problem
"... The collision problem is to decide whether a function X: {1,..., n} → {1,..., n} is onetoone or twotoone, given that � one of these is the case. We show a lower bound of Ω n 1/5 on the number of queries needed by a quantum computer to solve this problem with bounded�error probability. The best ..."
Abstract
 Add to MetaCart
The collision problem is to decide whether a function X: {1,..., n} → {1,..., n} is onetoone or twotoone, given that � one of these is the case. We show a lower bound of Ω n 1/5 on the number of queries needed by a quantum computer to solve this problem with bounded�error probability. The best
1 Mitigating the Reader Collision Problem in RFID Networks with Mobile Readers
"... Abstract — Radio Frequency Identification (RFID) is a means to identify and track objects using radio frequency transmission. An RFID system consists of readers and tags. Readers use radio signals to communicate with the tags. Tags may be active (battery powered) or passive (powered by the reader’s ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
signals). RFID is increasingly being used in many applications such as inventory management, object tracking, retail checkout etc. The reader collision problem occurs when the signal from one reader interferes with the signal from other readers. Such interference can result in lack of communication
Results 1  10
of
79,471