Bug 1271 - The LSH could make use of a KD or similar tree to find the closest hashes
Summary: The LSH could make use of a KD or similar tree to find the closest hashes
Status: NEW
Alias: None
Product: BpmDj - old linux tools
Classification: Unclassified
Component: selector (show other bugs)
Version: 4.2
Hardware: PC Linux
: Future enhancement
Assignee: Werner Van Belle
URL:
Depends on:
Blocks:
 
Reported: 2011-04-28 07:20 CEST by Werner Van Belle
Modified: 2011-04-28 07:20 CEST (History)
0 users

See Also:

Attachments
Add an attachment (proposed patch, testcase, etc.)

Note You need to log in before you can comment on or make changes to this bug.
Description Werner Van Belle 2011-04-28 07:20:18 CEST