Search Results for "data collection algorithm"
Sort By:
Showing 187 open source projects for "data collection algorithm"
View related business solutions-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
-
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
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
Rust Data Analysis
Rust for data analysis encyclopedia (WIP)
Welcome to the Rust Data Analysis repository! This collection of Jupyter notebooks provides a comprehensive exploration of data analysis using Rust. Powered by a Rust kernel, these notebooks allow you to dive deep into the realm of data analysis, leveraging the capabilities of the Rust programming language. With the help of various Rust libraries, such as ndarray, plotters, and more, you'll be able to extract valuable insights from different datasets with ease. -
3
Yggdrasil
Collection of builder repositories for BinaryBuilder.jl
This repository contains recipes for building binaries for Julia packages using BinaryBuilder.jl. -
4
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. -
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.
-
5
NannyML
Detecting silent model failure. NannyML estimates performance
... science, empowering data scientist to quickly understand and automatically detect silent model failure. By using NannyML, data scientists can finally maintain complete visibility and trust in their deployed machine learning models. When the actual outcome of your deployed prediction models is delayed, or even when post-deployment target labels are completely absent, you can use NannyML's CBPE-algorithm to estimate model performance. -
6
iRODS
Open Source Data Management Software
The Integrated Rule-Oriented Data System (iRODS) is open-source data management software used by research, commercial, and governmental organizations worldwide. iRODS is released as a production-level distribution aimed at deployment in mission-critical environments. It virtualizes data storage resources, so users can take control of their data, regardless of where and on what device the data is stored. The development infrastructure supports exhaustive testing on supported platforms; plugin... -
7
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. -
8
Delta
A viewer for git and diff output
Code evolves, and we all spend time studying diffs. 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... -
9
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. -
Get the most trusted enterprise browserDefend against security incidents with Chrome Enterprise. Create customizable controls, manage extensions and set proactive alerts to keep your data and employees protected without slowing down productivity.
-
10
Roots.jl
Root finding functions for Julia
... where f(a) and f(b) have alternate signs), a bracketing method, like Bisection, can be specified. 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. -
11
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... -
12
Go Recipes
Collection of handy tools for Go projects
Visualize the distribution of code coverage in your project. This helps to identify code areas with high and low coverage. Useful when you have a large project with lots of files and packages. 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... -
13
Helix Toolkit
Helix Toolkit is a collection of 3D components for .NET
Helix Toolkit is an open source 3D library that is licensed under the MIT license. The MIT license is very permissive and permits use in proprietary software. The library is based on .NET and is currently focusing on the WPF platform. The goal has been to make it easy to work with 3D in WPF, and also provide features that are not included in the standard WPF 3D visual model. Adds variety of functionalities/models on the top of internal WPF 3D models (Media3D namespace). dds variety of... -
14
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. -
15
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. -
16
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. -
17
Clustering.jl
A Julia package for data clustering
Methods for data clustering and evaluation of clustering quality. -
18
TIGRE
TIGRE: Tomographic Iterative GPU-based Reconstruction Toolbox
... 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. -
19
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... -
20
BasicBSpline.jl
Basic (mathematical) operations for B-spline functions
Basic (mathematical) operations for B-spline functions and related things with Julia. -
21
hctsa
Highly comparative time-series analysis
hctsa is a Matlab software package for running highly comparative time-series analysis. It extracts thousands of time-series features from a collection of univariate time series and includes a range of tools for visualizing and analyzing the resulting time-series feature matrix. -
22
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. -
23
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. -
24
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. -
25
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.
