All entries.
Showing Items 341-350 of 634 on page 35 of 64: First Previous 30 31 32 33 34 35 36 37 38 39 40 Next Last

Logo r-cran-maptree 1.4-7

by r-cran-robot - November 24, 2012, 00:00:00 CET [ Project Homepage BibTeX Download ] 1791 views, 491 downloads, 0 subscriptions

About: Mapping, pruning, and graphing tree models

Changes:

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


Logo r-cran-lasso2 1.2-14

by r-cran-robot - November 20, 2012, 00:00:00 CET [ Project Homepage BibTeX Download ] 9763 views, 2079 downloads, 1 subscription

About: L1 constrained estimation aka `lasso'

Changes:

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


Logo Divvy 1.1.1

by jlewis - November 14, 2012, 20:21:29 CET [ Project Homepage BibTeX Download ] 4090 views, 2158 downloads, 1 subscription

About: Divvy is a Mac OS X application for performing dimensionality reduction, clustering, and visualization.

Changes:

Initial Announcement on mloss.org.


Logo r-cran-ipred 0.9-1

by r-cran-robot - November 14, 2012, 00:00:00 CET [ Project Homepage BibTeX Download ] 15518 views, 3621 downloads, 1 subscription

About: Improved Predictors

Changes:

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


Logo r-cran-penalized 0.9-42

by r-cran-robot - November 6, 2012, 00:00:00 CET [ Project Homepage BibTeX Download ] 24205 views, 5333 downloads, 1 subscription

About: L1 (lasso and fused lasso) and L2 (ridge) penalized estimation in GLMs and in the Cox model

Changes:

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


Logo Reranker Framework 1.0

by zenog - October 29, 2012, 10:05:30 CET [ Project Homepage BibTeX Download ] 2691 views, 814 downloads, 1 subscription

About: ReFr is a software architecture for specifying, training and using reranking models.

Changes:

Initial Announcement on mloss.org.


Logo UniverSVM 1.22

by fabee - October 16, 2012, 11:24:12 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 26390 views, 3971 downloads, 0 subscriptions

About: The UniverSVM is a SVM implementation written in C/C++. Its functionality comprises large scale transduction via CCCP optimization, sparse solutions via CCCP optimization and data-dependent [...]

Changes:

Minor changes: fix bug on set_alphas_b0 function (thanks to Ferdinand Kaiser - ferdinand.kaiser@tut.fi)


Logo MROGH 1.0

by openpr_nlpr - October 16, 2012, 04:41:51 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4107 views, 832 downloads, 1 subscription

About: An implementation of MROGH descriptor. For more information, please refer to: “Bin Fan, Fuchao Wu and Zhanyi Hu, Aggregating Gradient Distributions into Intensity Orders: A Novel Local Image Descriptor, CVPR 2011, pp.2377-2384.” The most up-to-date information can be found at : http://vision.ia.ac.cn/Students/bfan/index.htm

Changes:

Initial Announcement on mloss.org.


Logo r-cran-randomForest 4.6-7

by r-cran-robot - October 16, 2012, 00:00:00 CET [ Project Homepage BibTeX Download ] 17493 views, 3502 downloads, 1 subscription

About: Breiman and Cutler's random forests for classification and regression

Changes:

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


Logo TurboParser 2.0

by afm - October 11, 2012, 02:59:04 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 7084 views, 1579 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.


Showing Items 341-350 of 634 on page 35 of 64: First Previous 30 31 32 33 34 35 36 37 38 39 40 Next Last