Projects running under linux.
Showing Items 121-140 of 236 on page 7 of 12: First Previous 2 3 4 5 6 7 8 9 10 11 12 Next

Logo OpenCV Based Extended Kalman Filter Frame 1.0.0

by openpr_nlpr - December 2, 2011, 05:23:56 CET [ Project Homepage BibTeX Download ] 1680 views, 508 downloads, 1 subscription

About: A simple and clear OpenCV based extended Kalman filter(EKF) abstract class implementation,absolutely following standard EKF equations. Special thanks to the open source project of KFilter1.3. It is easy to inherit it to implement a variable state and measurement EKF for computer vision and INS usages.

Changes:

Initial Announcement on mloss.org.


Logo Supervised Latent Semantic Indexing 1.0.0

by openpr_nlpr - December 2, 2011, 05:20:50 CET [ Project Homepage BibTeX Download ] 1257 views, 365 downloads, 1 subscription

About: Supervised Latent Semantic Indexing(SLSI) is an supervised feature transformation method. The algorithms in this package are based on the iterative algorithm of Latent Semantic Indexing.

Changes:

Initial Announcement on mloss.org.


Logo SIFT Extractor 1.0.0

by openpr_nlpr - December 2, 2011, 05:18:35 CET [ Project Homepage BibTeX Download ] 1396 views, 471 downloads, 1 subscription

About: This program is used to extract SIFT points from an image.

Changes:

Initial Announcement on mloss.org.


Logo Layer Based Dependency Parser 1.0.0

by openpr_nlpr - December 2, 2011, 04:51:23 CET [ Project Homepage BibTeX Download ] 1191 views, 395 downloads, 1 subscription

About: LDPar is an efficient data-driven dependency parser. You can train your own parsing model on treebank data and parse new data using the induced model.

Changes:

Initial Announcement on mloss.org.


About: This program is used to extract HOG(histograms of oriented gradients) features from images. The integral histogram is used for fast histogram extraction. Both APIs and binary utility are provided.

Changes:

Initial Announcement on mloss.org.


Logo Quasi Dense Matching 1.0.0

by openpr_nlpr - December 2, 2011, 04:44:19 CET [ Project Homepage BibTeX Download ] 1389 views, 423 downloads, 1 subscription

About: This program is used to find point matches between two images. The procedure can be divided into two parts: 1) use SIFT matching algorithm to find sparse point matches between two images. 2) use "quasi-dense propagation" algorithm to get "quasi-dense" point matches.

Changes:

Initial Announcement on mloss.org.


Logo Probabilistic Latent Semantic Indexing 1.0.0

by openpr_nlpr - December 2, 2011, 04:42:02 CET [ Project Homepage BibTeX Download ] 1313 views, 346 downloads, 1 subscription

About: Hofmann, T. 1999. Probabilistic latent semantic indexing. In Proceedings of the 22nd ACM-SIGIR International Conference on Research and Development in Information Retrieval (Berkeley,Calif.), ACM, New York, 50–57.

Changes:

Initial Announcement on mloss.org.


Logo Agglomerative MeanShift Clustering 1.0.0

by openpr_nlpr - December 2, 2011, 04:38:13 CET [ Project Homepage BibTeX Download ] 1641 views, 520 downloads, 1 subscription

About: Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets. For the purpose of algorithm speedup, an agglomerative MS clustering method called Agglo-MS was developed, along with its mode-seeking ability and convergence property analysis. The method is built upon an iterative query set compression mechanism which is motivated by the quadratic bounding optimization nature of MS. The whole framework can be efficiently implemented in linear running time complexity.

Changes:

Initial Announcement on mloss.org.


Logo Calculate Normalized Information Measures 1.0.0

by openpr_nlpr - December 2, 2011, 04:35:32 CET [ Project Homepage BibTeX Download ] 1195 views, 370 downloads, 1 subscription

About: The toolbox is to calculate normalized information measures from a given m by (m+1) confusion matrix for objective evaluations of an abstaining classifier. It includes total 24 normalized information measures based on three groups of definitions, that is, mutual information, information divergence, and cross entropy.

Changes:

Initial Announcement on mloss.org.


Logo Scilab Pattern Recognition Toolbox 0.0.2

by openpr_nlpr - December 2, 2011, 04:27:49 CET [ Project Homepage BibTeX Download ] 1368 views, 369 downloads, 1 subscription

About: Scilab Pattern Recognition Toolbox is a toolbox developed for Scilab software, and is used in pattern recognition, machine learning and the related field. It is developed for the purpose of education and research.

Changes:

Initial Announcement on mloss.org.


Logo GraphLab v1-1908

by dannybickson - November 22, 2011, 12:50:00 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4807 views, 827 downloads, 1 subscription

About: Multicore/distributed large scale machine learning framework.

Changes:

Update version.


Logo SGD 2.0

by leonbottou - October 11, 2011, 20:59:41 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 10695 views, 1697 downloads, 5 subscriptions

Rating Whole StarWhole StarWhole StarWhole StarEmpty Star
(based on 2 votes)

About: The SGD-2.0 package contains implementations of the SGD and ASGD algorithms for linear SVMs and linear CRFs.

Changes:

Version 2.0 features ASGD.


About: FLANN is a library for performing fast approximate nearest neighbor searches in high dimensional spaces. It contains a collection of algorithms we found to work best for nearest neighbor search.

Changes:

See project page for changes.


Logo GritBot 2.01

by zenog - September 2, 2011, 14:56:26 CET [ Project Homepage BibTeX Download ] 2418 views, 599 downloads, 1 subscription

About: GritBot is an data cleaning and outlier/anomaly detection program.

Changes:

Initial Announcement on mloss.org.


Logo Cubist 2.07

by zenog - September 2, 2011, 14:52:17 CET [ Project Homepage BibTeX Download ] 2514 views, 655 downloads, 1 subscription

About: Cubist is the regression counterpart to the C5.0 decision tree tool.

Changes:

Initial Announcement on mloss.org.


Logo C5.0 2.07

by zenog - September 2, 2011, 14:49:04 CET [ Project Homepage BibTeX Download ] 2725 views, 687 downloads, 1 subscription

About: C5.0 is the successor of the C4.5 decision tree algorithm/tool. In particular, it is faster and more memory-efficient.

Changes:

Initial Announcement on mloss.org.


Logo SketchSort 0.0.6

by ytabei - October 11, 2010, 18:33:21 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 3577 views, 604 downloads, 1 subscription

About: A Sortware for All Pairs Similarity Search

Changes:

Initial Announcement on mloss.org.


Logo OpenViBE 0.8.0

by k3rl0u4rn - October 1, 2010, 16:15:08 CET [ Project Homepage BibTeX Download ] 11380 views, 3162 downloads, 1 subscription

Rating Whole StarWhole StarWhole StarEmpty StarEmpty Star
(based on 1 vote)

About: OpenViBE is an opensource platform that enables to design, test and use Brain-Computer Interfaces (BCI). Broadly speaking, OpenViBE can be used in many real-time Neuroscience applications [...]

Changes:

New release 0.8.0.


Logo jblas 1.1.1

by mikio - September 1, 2010, 13:53:51 CET [ Project Homepage BibTeX Download ] 12335 views, 3076 downloads, 1 subscription

Rating Whole StarWhole StarWhole Star1/2 StarEmpty Star
(based on 2 votes)

About: jblas is a fast linear algebra library for Java. jblas is based on BLAS and LAPACK, the de-facto industry standard for matrix computations, and uses state-of-the-art implementations like ATLAS for all its computational routines, making jBLAS very fast.

Changes:

Changes from 1.0:

  • Added singular value decomposition
  • Fixed bug with returning complex values
  • Many other minor improvements

Logo redsvd 0.1.0

by hillbig - August 30, 2010, 18:13:55 CET [ Project Homepage BibTeX Download ] 4100 views, 888 downloads, 1 subscription

About: redsvd is a library for solving several matrix decomposition (SVD, PCA, eigen value decomposition) redsvd can handle very large matrix efficiently, and optimized for a truncated SVD of sparse matrices. For example, redsvd can compute a truncated SVD with top 20 singular values for a 100K x 100K matrix with 10M nonzero entries in about two second.

Changes:

Initial Announcement on mloss.org.


Showing Items 121-140 of 236 on page 7 of 12: First Previous 2 3 4 5 6 7 8 9 10 11 12 Next