Apple Point problem

APPLE POINT PROBLEM. You have a fixed data set (D) of objects (D(i)) represented with points on a lattice. For a given set of points on a lattice X, for all i, you rank similarity between X and D(i). Now, for a given X, how many dots do you need to add or remove to change the 1st position in the ranking?




About misha

Imagine a story that one can't believe. Hi. Life changes here. Small things only.
This entry was posted in Mathematics. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s