Sure, but unless I can figure out some way to choose a small number
of vectors, I'm left with computing the full N^2 set. Given that I'm
shooting for N to be 4 million or larger, that's a lot of data to
store.....
On Oct 2, 2005, at 12:14 PM, Todd A. Cook wrote:
Ben wrote:
Just the number of bits, not which ones. Basically, the hamming
distance.
I see. Could you pre-compute the bit counts for the vectors in the
table?
You could count the bits in the search vector as Martijn suggested,
and then
do a lookup based on the count.
-- todd
---------------------------(end of broadcast)---------------------------
TIP 2: Don't 'kill -9' the postmaster
