Search Results for "data collection algorithm"
Sort By:
Showing 34 open source projects for "data collection algorithm"
View related business solutions-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
-
Simple, Secure Domain RegistrationRegister or renew your domain and pay only what we pay. No markups, hidden fees, or surprise add-ons. Choose from over 400 TLDs (.com, .ai, .dev). Every domain is integrated with Cloudflare's industry-leading DNS, CDN, and free SSL to make your site faster and more secure. Simple, secure, at-cost domain registration.
-
1
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. -
2
Yggdrasil
Collection of builder repositories for BinaryBuilder.jl
This repository contains recipes for building binaries for Julia packages using BinaryBuilder.jl. -
3
MIRT.jl
MIRT: Michigan Image Reconstruction Toolbox (Julia version)
MIRT.jl is a collection of Julia functions for performing image reconstruction and solving related inverse problems. It is very much still under construction, although there are already enough tools to solve useful problems like compressed sensing MRI reconstruction. Trying the demos is a good way to get started. The documentation is even more still under construction. -
4
Coluna.jl
Branch-and-Price-and-Cut in Julia
Coluna is a branch-and-price-and-cut framework written in Julia. You write an original MIP that models your problem using the JuMP modeling language and our specific extension BlockDecomposition offers a syntax to specify the problem decomposition. 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. -
Keep company data safe with Chrome EnterpriseMake AI work your way with Chrome Enterprise. Block unapproved sites and set custom data controls that align with your company's policies.
-
5
BasicBSpline.jl
Basic (mathematical) operations for B-spline functions
Basic (mathematical) operations for B-spline functions and related things with Julia. -
6
Graphs.jl
An optimized graphs package for the Julia programming language
The goal of Graphs.jl is to offer a performant platform for network and graph analysis in Julia, following the example of libraries such as NetworkX in Python. Offers a set of simple, concrete graph implementations – SimpleGraph (for undirected graphs) and SimpleDiGraph (for directed graphs), an API for the development of more sophisticated graph implementations under the AbstractGraph type, and a large collection of graph algorithms with the same requirements as this API. -
7
GeophysicalFlows.jl
Geophysical fluid dynamics pseudospectral solvers with Julia
GeophysicalFlows.jl is a collection of modules that leverage the FourierFlows.jl framework to provide solvers for problems in Geophysical Fluid Dynamics, on periodic domains using Fourier-based pseudospectral methods. -
8
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. -
9
DFTK.jl
Density-functional toolkit
The density-functional toolkit, DFTK for short, is a collection of Julia routines for experimentation with plane-wave density-functional theory (DFT). The unique feature of this code is its emphasis on simplicity and flexibility with the goal of facilitating algorithmic and numerical developments as well as interdisciplinary collaboration in solid-state research. -
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
MultivariatePolynomials.jl
Multivariate polynomials interface
... the user to easily switch between different representations of polynomials to see which one is faster for the algorithm that he is using. -
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
Fermi.jl
Fermi quantum chemistry program
... collection of methods implemented in the package itself. However, the Fermi API is designed to make high performance pilot implementations of methods achievable. -
13
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... -
14
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. -
15
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. -
16
Clustering.jl
A Julia package for data clustering
Methods for data clustering and evaluation of clustering quality. -
17
Parsers.jl
fast parsing machinery for basic types in Julia
A collection of type parsers and utilities for Julia. Installation: at the Julia REPL, import Pkg; Pkg.add("Parsers") Parsers is maintained collectively by the JuliaData collaborators. Responsiveness to pull requests and issues can vary, depending on the availability of key collaborators. -
18
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. -
19
PeriodicTable.jl
Periodic Table for Julians
A very simple package for accessing elements in the Periodic Table. PeriodicTable.jl provides a Julia interface to a small database of element properties for all of the elements in the periodic table. In particular PeriodicTable exports a global variable called elements, which is a collection of Element data structures. -
20
PhysicalConstants.jl
Collection of fundamental physical constants with uncertainties
PhysicalConstants.jl provides common physical constants. They are defined as instances of the new Constant type, which is a subtype of AbstractQuantity (from Unitful.jl package) and can also be turned into Measurement objects (from Measurements.jl package) at request. Constants are grouped into different submodules so that the user can choose different datasets as needed. Currently, 2014 and 2018 editions of CODATA recommended values of the fundamental physical constants are provided. -
21
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... -
22
ScientificTypes.jl
An API for dispatching on the "scientific" type of data
This package makes a distinction between machine type and scientific type of a Julia object. The machine type refers to the Julia type being used to represent the object (for instance, Float64). The scientific type is one of the types defined in ScientificTypesBase.jl reflecting how the object should be interpreted (for instance, Continuous or Multiclass). -
23
NonlinearSolve.jl
High-performance and differentiation-enabled nonlinear solvers
... 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. -
24
GMT.jl
Generic Mapping Tools Library Wrapper for Julia
The Generic Mapping Tools, GMT, is an open source collection of tools for manipulating geographic and Cartesian data sets (including filtering, trend fitting, gridding, projecting, etc.) and producing PostScript illustrations ranging from simple x–y plots via contour maps to artificially illuminated surfaces and 3D perspective views. This link will take you to an impressive collection of figures made with GMT. The GMT Julia wrapper was designed to work in a way the close as possible... -
25
Compat.jl
Compatibility across Julia versions
The Compat package is designed to ease interoperability between older and newer versions of the Julia language. In particular, in cases where it is impossible to write code that works with both the latest Julia master branch and older Julia versions, or impossible to write code that doesn't generate a deprecation warning in some Julia version, the Compat package provides a macro that lets you use the latest syntax in a backward-compatible way. This is primarily intended for use by other...
