Search Results for "algorithm"
Sort By:
Showing 58 open source projects for "algorithm"
View related business solutions-
Our Free Plans just got better! | Auth0You 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.
-
Automate contact and company data extractionGenerate leads at scale without building or maintaining scrapers. Use 10,000+ ready-made tools that handle authentication, pagination, and anti-bot protection. Pull data from business directories, social profiles, and public sources, then export to your CRM or database via API. Schedule recurring extractions, enrich existing datasets, and integrate with your workflows.
-
1
Algorithm Visualizer
Interactive Online Platform that Visualizes Algorithms from Code
Hacker Scripts is a light-hearted collection of small automation and demo scripts that solve amusing everyday tasks or illustrate quick integrations with external services. The repo collects short programs (originally a set of shell and Ruby scripts) and many community contributed ports in other languages to show “how you might automate X” — for example sending a quick SMS, firing off an email, or triggering a coffee maker — with examples and scheduling snippets included. The README explains... -
2
CausalInference.jl
Causal inference, graphical models and structure learning in Julia
Julia package for causal inference and analysis, graphical models and structure learning. This package contains code for the PC algorithm and the extended FCI algorithm, the score based greedy equivalence search (GES) algorithm, the Bayesian Causal Zig-Zag sampler and a function suite for adjustment set search. -
3
Manopt.jl
Optimization on Manifolds in Julia
Optimization Algorithm on Riemannian Manifolds. A framework to implement arbitrary optimization algorithms on Riemannian Manifolds. Library of optimization algorithms on Riemannian manifolds. Easy-to-use interface for (debug) output and recording values during an algorithm run. Several tools to investigate the algorithms, gradients, and optimality criteria. -
4
UMAP.jl
Uniform Manifold Approximation and Projection (UMAP) implementation
A pure Julia implementation of the Uniform Manifold Approximation and Projection dimension reduction algorithm. The umap function takes two arguments, X (a column-major matrix of shape (n_features, n_samples)), n_components (the number of dimensions in the output embedding), and various keyword arguments. -
Easy-to-use Business Software for the Waste Management Software IndustryDOP Software’s mission is to streamline waste and recycling business’ processes by providing them with dynamic, comprehensive software and services that increase productivity and quality of performance.
-
5
NonlinearSolve.jl
High-performance and differentiation-enabled nonlinear solvers
...The package includes its own high-performance nonlinear solvers which include the ability to swap out to fast direct and iterative linear solvers, along with the ability to use sparse automatic differentiation for Jacobian construction and Jacobian-vector products. NonlinearSolve.jl interfaces with other packages of the Julia ecosystem to make it easy to test alternative solver packages and pass small types to control algorithm swapping. It also interfaces with the ModelingToolkit.jl world of symbolic modeling to allow for automatically generating high-performance code. -
6
Coluna.jl
Branch-and-Price-and-Cut in Julia
...Then, Coluna reformulates the original MIP and optimizes the reformulation using the algorithms you choose. Coluna aims to be very modular and tweakable so that you can define the behavior of your customized branch-and-price-and-cut algorithm. -
7
Clustering.jl
A Julia package for data clustering
Methods for data clustering and evaluation of clustering quality. -
8
DynamicHMC
Implementation of robust dynamic Hamiltonian Monte Carlo methods
Implementation of robust dynamic Hamiltonian Monte Carlo methods in Julia. In contrast to frameworks that utilize a directed acyclic graph to build a posterior for a Bayesian model from small components, this package requires that you code a log-density function of the posterior in Julia. Derivatives can be provided manually, or using automatic differentiation. Consequently, this package requires that the user is comfortable with the basics of the theory of Bayesian inference, to the extent... -
9
BasicBSpline.jl
Basic (mathematical) operations for B-spline functions
Basic (mathematical) operations for B-spline functions and related things with Julia. -
Network Management Software and Tools for Businesses and Organizations | Auvik NetworksReduce IT headaches and save time with a proven solution for automated network discovery, documentation, and performance monitoring. Choose Auvik because you'll see value in minutes, and stay with us to improve your IT for years to come.
-
10
Lasso.jl
Lasso/Elastic Net linear and generalized linear models
Lasso.jl is a pure Julia implementation of the glmnet coordinate descent algorithm for fitting linear and generalized linear Lasso and Elastic Net models. -
11
Tulip.jl
Interior-point solver in pure Julia
Tulip is an open-source interior-point solver for linear optimization, written in pure Julia. It implements the homogeneous primal-dual interior-point algorithm with multiple centrality corrections and therefore handles unbounded and infeasible problems. Tulip’s main feature is that its algorithmic framework is disentangled from linear algebra implementations. This allows to seamless integration of specialized routines for structured problems. -
12
OptimalTransport.jl
Optimal transport algorithms for Julia
This package provides some Julia implementations of algorithms for computational optimal transport, including the Earth-Mover's (Wasserstein) distance, Sinkhorn algorithm for entropically regularized optimal transport as well as some variants or extensions. Notably, OptimalTransport.jl provides GPU acceleration through CUDA.jl and NNlibCUDA.jl. -
13
MultivariatePolynomials.jl
Multivariate polynomials interface
...On the one hand, This packages allows you to implement algorithms on multivariate polynomials that will be independant on the representation of the polynomial that will be chosen by the user. On the other hand, it allows the user to easily switch between different representations of polynomials to see which one is faster for the algorithm that he is using. -
14
TIGRE
TIGRE: Tomographic Iterative GPU-based Reconstruction Toolbox
...TIGRE is free to download and distribute: use it, modify it, add to it, and share it. Our aim is to provide a wide range of easy-to-use algorithms for the tomographic community "off the shelf". We would like to build a stronger bridge between algorithm developers and imaging researchers/clinicians by encouraging and supporting contributions from both sides to TIGRE. -
15
LinearSolve.jl
High-Performance Unified Interface for Linear Solvers in Julia
LinearSolve.jl is a unified interface for the linear solving packages of Julia. It interfaces with other packages of the Julia ecosystem to make it easy to test alternative solver packages and pass small types to control algorithm swapping. It also interfaces with the ModelingToolkit.jl world of symbolic modeling to allow for automatically generating high-performance code. Performance is key: the current methods are made to be highly performant on scalar and statically sized small problems, with options for large-scale systems. If you run into any performance issues, please file an issue. -
16
Roots.jl
Root finding functions for Julia
...The default is Bisection, for most floating point number types, employed in a manner exploiting floating point storage conventions. For other number types (e.g. BigFloat), an algorithm of Alefeld, Potra, and Shi is used by default. These default methods are guaranteed to converge. Other bracketing methods are available. -
17
Delta
A viewer for git and diff output
...Delta aims to make this both efficient and enjoyable: it allows you to make extensive changes to the layout and styling of diffs, as well as allowing you to stay arbitrarily close to the default git/diff output. Language syntax highlighting with color themes. Within-line highlights based on a Levenshtein edit inference algorithm. Git style strings (foreground color, background color, font attributes) are supported for >20 stylable elements. Delta provides Stylable box/line decorations to draw attention to commit, file and hunk header sections. Support for Git's color-moved feature. Code can be copied directly from the diff. n and N keybindings to move between files in large diffs, and between diffs in log -p views. ... -
18
Go Recipes
Collection of handy tools for Go projects
...This 2D image-hash of your project should be more representative than a single number. For each module, the node representing the greatest version (i.e., the version chosen by Go's minimal version selection algorithm) is colored green. Other nodes, which aren't in the final build list, are colored grey — by the official Go team. Use to find unexpected dependencies or visualize the project. Works best for a small number of packages, for large projects use grep to narrow down subgraph. Collect all the licenses or check if you can use the project for example in a proprietary or commercial environment. ... -
19
Bayesian Optimization
Python implementation of global optimization with gaussian processes
This is a constrained global optimization package built upon bayesian inference and gaussian process, that attempts to find the maximum value of an unknown function in as few iterations as possible. This technique is particularly suited for optimization of high cost functions, situations where the balance between exploration and exploitation is important. More detailed information, other advanced features, and tips on usage/implementation can be found in the examples folder. Follow the basic... -
20
Hypercube
Graph visualizing tool
Hypercube is a tool for visualizing DOT (graphviz), GML, GraphML, GXL and simple text-based graph representations as SVG and EPS images. Hypercube comes with a Qt based GUI application and a Qt-independent command-line tool. It uses a simulated annealing algorithm to lay out the graph, that can be easily parameterized to achieve the desired look. The main development goals are portability and easy usage rather than high performance and complexity. -
21
...Book uses the examples from the demo project to explain everything in details. The examples are from many different areas. Examples from the first part of the book are aimed at the details of algorithm and its use with different objects; examples from the second part are mostly the real and very useful applications.
-
22
Tree Visualisation with Visual Cues
Tree Visualisation with Visual Cues
This project extends a previous work on node link tree visualisation and interaction by providing visual clues on hidden structures. We adopt DOITree from Prefuse package (https://github.com/prefuse/Prefuse), a multi-focal tree layout algorithm, for exploring large hierarchical structures. Related publications: https://www.sciencedirect.com/science/article/pii/S1045926X1630009X https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6902871 -
23
TSNE-CUDA
GPU Accelerated t-SNE for CUDA with Python bindings
This repo is an optimized CUDA version of FIt-SNE algorithm with associated python modules. We find that our implementation of t-SNE can be up to 1200x faster than Sklearn, or up to 50x faster than Multicore-TSNE when used with the right GPU. You can install binaries with anaconda for CUDA version 10.1 and 10.2 using conda install tsnecuda -c conda-forge. Tsnecuda supports CUDA versions 9.0 and later through source installation, check out the wiki for up to date installation instructions. ... -
24
Learn Julia the Hard Way
Learn Julia the hard way
...Julia was developed with the occasional reference to R, and with an avowed intent to improve upon R's clunkiness. R is a great language, but relatively slow, to the point that most people use it to rapidly prototype, and then implement the algorithm for production in Python or Java. Julia seeks to be as approachable as R but without the speed penalty. -
25
CNN Explainer
Learning Convolutional Neural Networks with Interactive Visualization
...For example, an image classifier produces a class label (e.g, bird, plane) for what objects exist within an image. A convolutional neural network, or CNN for short, is a type of classifier, which excels at solving this problem! A CNN is a neural network: an algorithm used to recognize patterns in data. Neural Networks in general are composed of a collection of neurons that are organized in layers, each with their own learnable weights and biases. Let’s break down a CNN into its basic building blocks. A tensor can be thought of as an n-dimensional matrix. In the CNN above, tensors will be 3-dimensional with the exception of the output layer. ...
