Showing Items 311320 of 622 on page 32 of 63: First Previous 27 28 29 30 31 32 33 34 35 36 37 Next Last
About: hapFabia is an R package for identification of very short segments of identity by descent (IBD) characterized by rare variants in large sequencing data. It detects 100 times smaller segments than previous methods. Changes:o citation update o plot function improved

About: JOP is a Java virtual machine implemented in hardware. It is a hard realtime open source multicore processor capable of worst case execution time analysis of Java code. Changes:Initial Announcement on mloss.org.

About: PALMA computes the optimal spliced alignment of a mRNA sequence to a genomic sequence. The main python script takes two FASTA files containing the target (e.g. a DNA sequence, part of the genome) [...] Changes:Initial Announcement on mloss.org.

About: OLaRankGreedy is an online solver of the dual formulation of support vector machines for sequence labeling using greedy inference. Changes:Initial Announcement on mloss.org.

About: markov thebeast is a Markov Logic interpreter. We also see it as structured prediction framework in which the user can define a loglinear distribution over a complex output space. Changes:Initial Announcement on mloss.org.

About: The Rchemcpp package implements the marginalized graph kernel and extensions, Tanimoto kernels, graph kernels, pharmacophore and 3D kernels suggested for measuring the similarity of molecules. Changes:Moved from CRAN to Bioconductor. Improved handling of molecules, visualization and examples.

About: Orthonormal wavelet transform for D dimensional tensors in L levels. Generic quadrature mirror filters and tensor sizes. Runtime is O(n), plain C, MEXwrapper and demo provided. Changes:Initial Announcement on mloss.org. 
About: MATLAB toolbox for advanced BrainComputer Interface (BCI) research. Changes:Initial Announcement on mloss.org.

About: This software is designed for learning translation invariant kernels for classification with support vector machines. Changes:Initial Announcement on mloss.org.

About: The incomplete Cholesky decomposition for a dense symmetric positive definite matrix A is a simple way of approximating A by a matrix of low rank (you can choose the rank). It has been used [...] Changes:Initial Announcement on mloss.org.
