H

highdimentionalsearch

Settings | Report Duplicate

0

I Use This!

Activity Not Available

Analyzed about 3 years ago. based on code collected over 6 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.

Tags

In a Nutshell, highdimentionalsearch...

...
has had 10 commits made by 3 contributors
representing 1,615 lines of code
...
is mostly written in Java
with an average 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 17 years ago

Quick Reference

Code Locations:

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

Similar Projects:

Become the first manager for highdimentionalsearch

This Project has No vulnerabilities Reported Against it

Did You Know...

...
65% of companies leverage OSS to speed application development in 2016
...
anyone with an Open Hub account can update a project's tags
...
55% of companies leverage OSS for production infrastructure
...
you can embed statistics from Open Hub on your site

Code

Lines of Code

Activity

Commits per Month

Community

Contributors per Month

Languages

Java	97%
2 Other	3%

30 Day Summary

Jun 21 2016 — Jul 21 2016

0 Commits
0 Contributors

12 Month Summary

Jul 21 2015 — Jul 21 2016

0 Commits
0 Contributors

Most Recent Contributors

	httpd		abseeguiz
	Ohloh

Ratings

Be the first to rate this project

Click to add your rating

Review this Project!