All entries.
Showing Items 471-480 of 565 on page 48 of 57: First Previous 43 44 45 46 47 48 49 50 51 52 53 Next Last

Logo Metropolis Hastings algorithm 1.0.0

by openpr_nlpr - December 2, 2011, 05:43:20 CET [ Project Homepage BibTeX Download ] 1615 views, 432 downloads, 1 subscription

About: Metropolis-Hastings alogrithm is a Markov chain Monte Carlo method for obtaining a sequence of random samples from a probability distribution for which direct sampling is difficult. Thi sequence can be used to approximate the distribution.

Changes:

Initial Announcement on mloss.org.


Logo Urheen 1.0.0

by openpr_nlpr - December 2, 2011, 05:40:08 CET [ Project Homepage BibTeX Download ] 1614 views, 434 downloads, 1 subscription

About: Urheen is a toolkit for Chinese word segmentation, Chinese pos tagging, English tokenize, and English pos tagging. The Chinese word segmentation and pos tagging modules are trained with the Chinese Tree Bank 7.0. The English pos tagging module is trained with the WSJ English treebank(02-23).

Changes:

Initial Announcement on mloss.org.


Logo libmind alpha 1

by neuromancer - September 4, 2012, 04:30:57 CET [ Project Homepage BibTeX Download ] 1593 views, 442 downloads, 1 subscription

About: A general purpose library to process and predict sequences of elements using echo state networks.

Changes:

Initial Announcement on mloss.org.


Logo r-cran-bigRR 1.3-10

by r-cran-robot - August 23, 2014, 00:00:00 CET [ Project Homepage BibTeX Download ] 1569 views, 409 downloads, 0 subscriptions

About: Generalized Ridge Regression (with special advantage for p >> n cases)

Changes:

Fetched by r-cran-robot on 2015-02-01 00:00:04.282875


About: This code is developed based on Uriel Roque's active set algorithm for the linear least squares problem with nonnegative variables in: Portugal, L.; Judice, J.; and Vicente, L. 1994. A comparison of block pivoting and interior-point algorithms for linear least squares problems with nonnegative variables. Mathematics of Computation 63(208):625-643.Ran He, Wei-Shi Zheng and Baogang Hu, "Maximum Correntropy Criterion for Robust Face Recognition," IEEE TPAMI, in press, 2011.

Changes:

Initial Announcement on mloss.org.


Logo WebEnsemble 1.0

by jungc005 - May 8, 2012, 22:24:44 CET [ BibTeX Download ] 1506 views, 522 downloads, 1 subscription

About: Use the power of crowdsourcing to create ensembles.

Changes:

Initial Announcement on mloss.org.


Logo AROFAC 1.0

by kiraly - August 5, 2013, 10:56:21 CET [ BibTeX BibTeX for corresponding Paper Download ] 1490 views, 393 downloads, 1 subscription

About: Approximate Rank One FACtorization of tensors. An algorithm for factorization of three-way-tensors and determination of their rank, includes example applications.

Changes:

Initial Announcement on mloss.org.


Logo CMatrix Class 1.0.0

by openpr_nlpr - December 2, 2011, 05:28:41 CET [ Project Homepage BibTeX Download ] 1484 views, 440 downloads, 1 subscription

About: It's a C++ program for symmetric matrix diagonalization, inversion and principal component anlaysis(PCA). The matrix diagonalization function can also be applied to the computation of singular value decomposition (SVD), Fisher linear discriminant analysis (FLDA) and kernel PCA (KPCA) if forming the symmetric matrix appropriately.

Changes:

Initial Announcement on mloss.org.


Logo r-cran-gamboostLSS 1.0-3

by r-cran-robot - November 16, 2011, 00:00:00 CET [ Project Homepage BibTeX Download ] 1461 views, 288 downloads, 0 subscriptions

About: Boosting Methods for GAMLSS Models

Changes:

Fetched by r-cran-robot on 2013-04-01 00:00:04.956804


Logo Perspective 3 Points Solver 1.0.0

by openpr_nlpr - December 2, 2011, 05:31:04 CET [ Project Homepage BibTeX Download ] 1449 views, 453 downloads, 1 subscription

About: This is a implementation of the classic P3P(Perspective 3-Points) algorithm problem solution in the Ransac paper "M. A. Fischler, R. C. Bolles. Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography. Comm. of the ACM, Vol 24, pp 381-395, 1981.". The algorithm gives the four probable solutions of the P3P problem in about 0.1ms, and can be used as input of the consequent RANSAC step. The codes needs the numerics library VNL which is a part of the widely used computer vision library VXL. One can download & install it from http://vxl.sourceforge.net/.

Changes:

Initial Announcement on mloss.org.


Showing Items 471-480 of 565 on page 48 of 57: First Previous 43 44 45 46 47 48 49 50 51 52 53 Next Last