highdimentionalsearch

I Use This!

Activity Not Available

Analyzed over 2 years ago. based on code collected over 2 years ago.

Project Summary

The goal of the project is to find a good high dimensional search algorithm that improves performance of the previous nearest neighbor search algorithm implemented by Sammer A. Nene and Shree K. Nayer. Performance analysis of the new algorithm in comparison with the old one will be the result.

In a Nutshell, highdimentionalsearch...

...
has had 10 commits made by 3 contributors
representing 1,615 lines of code
...
is mostly written in Java
with a low number of source code comments
...
has a codebase with a very short history
maintained by nobody
with stable Y-O-Y commits
...
took an estimated 1 years of effort (COCOMO model)
starting with its first commit in September, 2005
ending with its most recent commit over 13 years ago

Quick Reference

Project Links:

Homepage

Code Locations:

:pserver:guest:@cvs.dev.java.net...

Similar Projects:

Managers:

Become the first manager for highdimentionalsearch

This Project has No vulnerabilities Reported Against it

Did You Know...

...
Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
...
learn about Open Hub updates and features on the Open Hub blog
...
there are over 3,000 projects on the Open Hub with security vulnerabilities reported against them
...
compare projects before you chose one to use