<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
the	O
cell-probe	B-Application
model	I-Application
is	O
a	O
model	B-Application
of	O
computation	O
similar	O
to	O
the	O
random-access	B-Application
machine	I-Application
,	O
except	O
that	O
all	O
operations	O
are	O
free	O
except	O
memory	O
access	O
.	O
</s>
<s>
This	O
model	B-Application
is	O
useful	O
for	O
proving	O
lower	O
bounds	O
of	O
algorithms	O
for	O
data	O
structure	O
problems	O
.	O
</s>
<s>
The	O
cell-probe	B-Application
model	I-Application
is	O
a	O
minor	O
modification	O
of	O
the	O
random-access	B-Application
machine	I-Application
model	B-Application
,	O
itself	O
a	O
minor	O
modification	O
of	O
the	O
counter	B-Application
machine	I-Application
model	B-Application
,	O
in	O
which	O
computational	O
cost	O
is	O
only	O
assigned	O
to	O
accessing	O
units	O
of	O
memory	O
called	O
cells	O
.	O
</s>
<s>
In	O
this	O
model	B-Application
,	O
computation	O
is	O
framed	O
as	O
a	O
problem	O
of	O
querying	O
a	O
set	O
of	O
memory	O
cells	O
.	O
</s>
<s>
This	O
model	B-Application
is	O
useful	O
in	O
the	O
analysis	O
of	O
data	O
structures	O
.	O
</s>
<s>
In	O
particular	O
,	O
the	O
model	B-Application
clearly	O
shows	O
a	O
minimum	O
number	O
of	O
memory	O
accesses	O
to	O
solve	O
a	O
problem	O
in	O
which	O
there	O
is	O
stored	O
data	O
on	O
which	O
we	O
would	O
like	O
to	O
run	O
some	O
query	O
.	O
</s>
<s>
"	O
,	O
Yao	O
described	O
the	O
cell-probe	B-Application
model	I-Application
and	O
used	O
it	O
to	O
give	O
a	O
minimum	O
number	O
of	O
memory	O
cell	O
"	O
probes	O
"	O
or	O
accesses	O
necessary	O
to	O
determine	O
whether	O
a	O
given	O
query	O
datum	O
exists	O
within	O
a	O
table	O
stored	O
in	O
memory	O
.	O
</s>
<s>
Mihai	O
Pătraşcu	O
used	O
the	O
cell-probe	B-Application
model	I-Application
and	O
an	O
information	O
transfer	O
argument	O
to	O
show	O
that	O
the	O
partial	O
sums	O
problem	O
requires	O
time	O
per	O
operation	O
.	O
</s>
<s>
The	O
exact	O
nearest	B-Algorithm
neighbor	I-Algorithm
search	I-Algorithm
problem	O
is	O
to	O
determine	O
the	O
closest	O
in	O
a	O
set	O
of	O
input	O
points	O
to	O
a	O
given	O
query	O
point	O
.	O
</s>
<s>
Chakrabarti	O
and	O
Regev	O
proved	O
that	O
the	O
approximate	O
nearest	B-Algorithm
neighbor	I-Algorithm
search	I-Algorithm
problem	O
on	O
the	O
Hamming	O
cube	O
using	O
polynomial	O
storage	O
and	O
word	O
size	O
requires	O
a	O
worst-case	O
query	O
time	O
of	O
.	O
</s>
<s>
This	O
proof	O
used	O
the	O
cell-probe	B-Application
model	I-Application
and	O
information	O
theoretic	O
techniques	O
for	O
communication	O
complexity	O
.	O
</s>
