All entries.
Showing Items 511-520 of 543 on page 52 of 55: First Previous 47 48 49 50 51 52 53 54 55 Next

Logo Threshold Image for Small object 1.0

by openpr_nlpr - July 23, 2012, 11:25:46 CET [ Project Homepage BibTeX Download ] 1578 views, 435 downloads, 1 subscription

About: Including source code of Threshold Method,SVM,Play Scan and Play detection.

Changes:

Initial Announcement on mloss.org.


Logo Thresholding program 1.0

by openpr_nlpr - March 1, 2012, 03:18:52 CET [ Project Homepage BibTeX Download ] 3662 views, 442 downloads, 1 subscription

About: This is demo program on global thresholding for image of bright small objects, such as aircrafts in airports. the program include four method, otsu,2D-Tsallis,PSSIM, Smoothnees Method.

Changes:

Initial Announcement on mloss.org.


Logo TiMBL 6.1

by antalvdb - January 11, 2008, 09:20:57 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 5439 views, 1233 downloads, 0 comments, 0 subscriptions

About: The TiMBL software package is a fast, decision-tree-based implementation of k-nearest neighbor classification. The package includes the IB1, IB2, TRIBL, TRIBL2, and IGTree algorithms, and offers [...]

Changes:

Initial Announcement on mloss.org.


Logo TMBP 1.0

by zengjia - April 5, 2012, 06:42:26 CET [ BibTeX BibTeX for corresponding Paper Download ] 4123 views, 2013 downloads, 2 subscriptions

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

About: Message passing for topic modeling

Changes:
  1. improve "readme.pdf".
  2. correct some compilation errors.

Logo Toeblitz Toolkit for Fast Toeplitz Matrix Operations 1.03

by cunningham - August 13, 2014, 02:21:36 CET [ BibTeX Download ] 2415 views, 611 downloads, 2 subscriptions

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 a write-up in written/toeblitz.pdf describing the package.


Logo Torch 3

by bengio - November 13, 2007, 01:38:29 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 5734 views, 1512 downloads, 1 subscription

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

About: Torch is a statistical machine learning library written in C++ at IDIAP,

Changes:

Initial Announcement on mloss.org.


Logo Torch 5 5.1

by andresy - October 1, 2008, 04:25:12 CET [ Project Homepage BibTeX Download ] 10840 views, 1552 downloads, 2 subscriptions

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

About: Torch5 provides a matlab-like environment for state-of-the-art machine learning algorithms. It is easy to use and provides a very efficient implementation, thanks to a easy and fast scripting [...]

Changes:

Initial Announcement on mloss.org.


Logo treelearn 1

by iskander - September 21, 2011, 16:12:27 CET [ Project Homepage BibTeX Download ] 2312 views, 553 downloads, 1 subscription

About: A python implementation of Breiman's Random Forests.

Changes:

Initial Announcement on mloss.org.


Logo TurboParser 2.0

by afm - October 11, 2012, 02:59:04 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4137 views, 914 downloads, 1 subscription

About: TurboParser is a free multilingual dependency parser based on linear programming developed by André Martins. It is based on joint work with Noah Smith, Mário Figueiredo, Eric Xing, Pedro Aguiar.

Changes:

This version introduces a number of new features:

  • The parser does not depend anymore on CPLEX (or any other non-free LP solver). Instead, the decoder is now based on AD3, our free library for approximate MAP inference.

  • The parser now outputs dependency labels along with the backbone structure.

  • As a bonus, we now provide a trainable part-of-speech tagger, called TurboTagger, which can be used in standalone mode, or to provide part-of-speech tags as input for the parser. TurboTagger has state-of-the-art accuracy for English (97.3% on section 23 of the Penn Treebank) and is fast (~40,000 tokens per second).

  • The parser is much faster than in previous versions. You may choose among a basic arc-factored parser (~4,300 tokens per second), a standard second-order model with consecutive sibling and grandparent features (the default; ~1,200 tokens per second), and a full model with head bigram and arbitrary sibling features (~900 tokens per second).

Note: The runtimes above are approximate, and based on experiments with a desktop machine with a Intel Core i7 CPU 3.4 GHz and 8GB RAM. To run this software, you need a standard C++ compiler. This software has the following external dependencies: AD3, a library for approximate MAP inference; Eigen, a template library for linear algebra; google-glog, a library for logging; gflags, a library for commandline flag processing. All these libraries are free software and are provided as tarballs in this package.

This software has been tested on Linux, but it should run in other platforms with minor adaptations.


Logo Tuwo 1.0

by nowozin - May 19, 2009, 09:19:41 CET [ Project Homepage BibTeX Download ] 3789 views, 914 downloads, 1 subscription

About: C++ Library for High-level Computer Vision Tasks

Changes:

Initial Announcement on mloss.org.


Showing Items 511-520 of 543 on page 52 of 55: First Previous 47 48 49 50 51 52 53 54 55 Next