OK :)
On Sat, Jul 16, 2011 at 2:32 AM, Divye Kapoor wrote:
> @Sagar: You misunderstand my concern.
>
> When I say hash collisions, I mean:
> Consider 2 very different images X and Y - both have the same hash value H.
> Such X and Y will always exist because you're mapping a larger
> informationa
@Sagar: You misunderstand my concern.
When I say hash collisions, I mean:
Consider 2 very different images X and Y - both have the same hash value H.
Such X and Y will always exist because you're mapping a larger informational
space to a smaller one (by pigeonhole principle in a sense).
Without a
Given 1000 million x 1000 million image, What information of
this image to be stored such that you can find the locations
when the given image has modi cations
--
Regards,
Navneet
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to
