47 search results - page 7 / 10 » The Cost of the Missing Bit: Communication Complexity with H... |
102
click to vote
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
122
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
101
click to vote
ARITH
2001
IEEE
15 years 3 months ago
2001
IEEE
The Instruction Set Architecture (ISA) of a programmable processor is the native languageof the machine. It defines the set of operations and resourcesthat are optimized for that ...
GLOBECOM
2009
IEEE
15 years 3 months ago
2009
IEEE
—We have recently proposed a novel receiver for Ultra-Wide-band Impulse-Radio communication in bursty applications like Wireless Sensor Networks. The receiver, based on the princ...
137
click to vote
QCQC
1998
Springer
15 years 4 months ago
1998
Springer
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...