With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Try free now
$300 Free Credits for Your Google Cloud Projects
Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
The GAN Zoo is an open-source repository that compiles a comprehensive list of Generative Adversarial Network models published in research literature. The project began as a community effort to track the rapidly growing number of GAN architectures appearing in machine learning papers. Because new GAN models are frequently introduced in research publications, the repository serves as a convenient catalog that organizes them in one location. The list includes references to many GAN variants...
neon is Intel's reference deep learning framework committed to best performance on all hardware. Designed for ease of use and extensibility. See the new features in our latest release. We want to highlight that neon v2.0.0+ has been optimized for much better performance on CPUs by enabling Intel Math Kernel Library (MKL). The DNN (Deep Neural Networks) component of MKL that is used by neon is provided free of charge and downloaded automatically as part of the neon installation. ...
...An existing density-based clustering algorithm, which is applied to the rescaled dataset, can find all clusters with varying densities that would otherwise impossible had the same algorithm been applied to the unscaled dataset.
Reference: Zhu, Y., Ting, K. M., & Carman, M. J. (2016). Density-ratio based clustering for discovering clusters with varying densities. Pattern Recognition.
http://www.sciencedirect.com/science/article/pii/S0031320316301571
Repository which contains links and resources on different topics
...The repository is organized into directories by subject so that users can easily locate relevant learning materials within a specific discipline. Because it collects external resources rather than implementing software itself, the project acts as a reference library for students and developers who want to explore reliable educational content in computer science. Contributors can expand the repository by adding links, creating new topic categories, or updating outdated resources.
Supervised Ranking of Contigs in de novo Assemblies
SuRankCo is a machine learning based software to score and rank contigs from de novo assemblies of next generation sequencing data. It trains with alignments of contigs with known reference genomes and predicts scores and ranking for contigs which have no related reference genome yet.
For more details about SuRankCo and its functioning, please see
"SuRankCo: Supervised Ranking of Contigs in de novo Assemblies"
Mathias Kuhring, Piotr Wojtek Dabrowski, Andreas Nitsche and Bernhard Y. Renard
(http://www.biomedcentral.com/1471-2105/16/240/abstract)
PLEASE NOTE, it is recommended to read the paper and the readme.txt file before using SuRankCo.
...
Isolation Forest detects data-anomalies using binary trees. Platform: R (www.r-project.org) Reference: Fei Tony Liu, Kai Ming Ting, and Zhi-Hua Zhou, “Isolation Forest”, IEEE International Conference on Data Mining 2008 (ICDM 08)