PURR Registry

The manuscript presents a non-parametric Bayesian algorithm called ASPIRE (Anomalous Sample Phenotype Identification with Random Effects) able to identify phenotypic differences across batches of cytometry samples in the presence of random effects

AML Bayesian Biomedical Engineering BMC Bioinformatics Computer Science cytometry Dirichlet process Gaussian mixture model Interdisciplinary Research Life Sciences random effects

RP1D (Clustering Method Using 1D Random Projections)

10.4231/R74F1NN4

Mireille Boutin , Sangchun Han

11/12/2014

The source code of RP1D (Clustering Method Using 1D Random Projections).

Clustering Computer Science Electrical and Computer Engineering Random Projection Source Code

Task analysis cases and results for Ex Libris Primo at Purdue University Libraries

10.4231/R7CZ3538

Marlen Promann , Tao Zhang

11/06/2014

These figures represent the task analysis results of different use cases of Ex Libris Primo implemented at Purdue University Libraries, depending on the availability and format of the resource being searched by the user.

Computer Science Library Science Library Website Primo Task Analysis

Link Pivot Algorithm for Offset Optimization

10.4231/R7GQ6VPT

Christopher Day , Darcy M. Bullock

11/20/2014

This animation illustrates the use of the Link Pivot algorithm for optimizing offsets on a signalized arterial.

Civil Engineering Computer Science optimization traffic engineering traffic signal timing traffic signals

HUBbub 2013 Survey Data

10.4231/R7JD4TQM

Michael G. Zentner

08/31/2015

A CSV and accompanying HTML zip file of data taken at a survey about data sharing during HUBbub 2013.

Computer Science Survey

Source code for the paper Polynomial Fitting Known Plaintext Attack

10.4231/R7GH9FWM

James Alan Vaught

11/20/2015

This file contains C++ source code for the numerical experiments described in the paper Polynomial Fitting Known Plaintext Attack.

Computer Science cryptanalysis encryption Information Security known plaintext attack polynomial fitting

OPCBSPL: Orthogonal polynomials relative to cardinal B-spline weight functions

10.4231/R7NG4NKC

Walter Gautschi

10/28/2016

A stable and efficient discretization procedure is developed to compute recurrence coefficients for orthogonal polynomials whose weight function is a polynomial cardinal B-spline of order greater than, or equal to, one.

B-spline Computer Science Mathematics Modification algorithms for orthogonal polynomials Orthogonal polynomials polynomials Walter Gautschi Archives weight functions

Code and Dataset for Pattern Recognition Benchmarks

10.4231/R7610X8M

Jonas Hepp , Mireille Boutin , Yellamraju Tarun

02/03/2016

This code computed a sequence of bounds for the error rate of a pattern recognition method. The bounds correspond to the error rate that one would expect to achieve by simply selecting features at random and thresholding the feature (TARP) approach.

classification Computer Science Electrical and Computer Engineering feature evaluation image processing image recognition Pattern Recognition Pedestrian Classification

Display #

Results 1 - 10 of 302

Datasets

All fields DOI Author Subject Search

Subject

Creator

Type

Date

Total is 302 Results