All entries.
Showing Items 431-440 of 519 on page 44 of 52: First Previous 39 40 41 42 43 44 45 46 47 48 49 Next Last

Logo Urheen 1.0.0

by openpr_nlpr - December 2, 2011, 05:40:08 CET [ Project Homepage BibTeX Download ] 1178 views, 314 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 BCFWstruct 1.0.0

by ppletscher - June 25, 2013, 16:19:33 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 1175 views, 290 downloads, 1 subscription

About: Block-Coordinate Frank-Wolfe Optimization for Structural SVMs

Changes:

Initial Announcement on mloss.org.


About: A fast and robust learning of Bayesian networks

Changes:

Initial Announcement on mloss.org.


Logo SkyVoice TTS and SDK 1.0

by openpr_nlpr - September 10, 2012, 03:48:47 CET [ Project Homepage BibTeX Download ] 1161 views, 257 downloads, 1 subscription

About: Text-to-Speech (TTS) is a kind of speech processing technology that converts text into speech. It involves phonetics, linguistics, digital signal processing technology, computer technology, multimedia technology, and other technologies. It is a frontier technology in Chinese information processing field. With TTS technology, any text used to be read by eyes can also be listened by ears.

Changes:

Initial Announcement on mloss.org.


Logo OpenCV Based Extended Kalman Filter Frame 1.0.0

by openpr_nlpr - December 2, 2011, 05:23:56 CET [ Project Homepage BibTeX Download ] 1155 views, 346 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.


About: TBEEF, a doubly ensemble framework for recommendation and prediction problems.

Changes:

Updated the included documentation.


About: Toeblitz is a MATLAB/Octave package for operations on positive definite Toeplitz matrices. It can solve Toeplitz systems Tx = b in O(n*log(n)) time and O(n) memory, compute matrix inverses T^(-1) (with free log determinant) in O(n^2) time and memory, compute log determinants (without inverses) in O(n^2) time and O(n) memory, and compute traces of products A*T for any matrix A, in minimal O(n^2) time and memory.

Changes:

Adding tar directly instead of via link


Logo WebEnsemble 1.0

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

About: Use the power of crowdsourcing to create ensembles.

Changes:

Initial Announcement on mloss.org.


Logo Metropolis Hastings algorithm 1.0.0

by openpr_nlpr - December 2, 2011, 05:43:20 CET [ Project Homepage BibTeX Download ] 1115 views, 274 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.


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.


Showing Items 431-440 of 519 on page 44 of 52: First Previous 39 40 41 42 43 44 45 46 47 48 49 Next Last