Search Results for "algorithm" - Page 4
Sort By:
Showing 2778 open source projects for "algorithm"
View related business solutions-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
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.
-
1
Boehm-Demers-Weiser Garbage Collector
The Boehm-Demers-Weiser conservative C/C++ Garbage Collector
The Boehm-Demers-Weiser conservative garbage collector can be used as a garbage collecting replacement for C malloc or C++ new. It allows you to allocate memory basically as you normally would, without explicitly deallocating memory that is no longer useful. The collector automatically recycles memory when it determines that it can no longer be otherwise accessed. The collector is also used by a number of programming language implementations that either use C as intermediate code, want to... -
2
z.lua
A new cd command that helps you navigate faster
z.lua is a faster way to navigate your filesystem. It tracks your most used directories, based on 'frecency'. After a short learning phase, z will take you to the most 'recent' directory that matches ALL of the regexes given on the command line, in order. Available for posix shells, bash, zsh, dash, sh, ash, ksh, busybox and etc. Available for Fish Shell, Power Shell and Windows cmd. An enhanced matching algorithm takes you to where ever you want precisely. Allow updating database only if $PWD... -
3
TBOX
A glib-like multi-platform c library
TBOX is a glib-like cross-platform C library that is simple to use yet powerful in nature. The project focuses on making C development easier and provides many modules (.e.g stream, coroutine, regex, container, algorithm ...), so that any developer can quickly pick it up and enjoy the productivity boost when developing in C language. It supports the following platforms: Windows, Macosx, Linux, Android, iOS, BSD and etc. Supports file, data, http and socket source. Supports the stream filter... -
4
Smile
Statistical machine intelligence and learning engine
Smile is a fast and comprehensive machine learning engine. With advanced data structures and algorithms, Smile delivers the state-of-art performance. Compared to this third-party benchmark, Smile outperforms R, Python, Spark, H2O, xgboost significantly. Smile is a couple of times faster than the closest competitor. The memory usage is also very efficient. If we can train advanced machine learning models on a PC, why buy a cluster? Write applications quickly in Java, Scala, or any JVM... -
Auth for GenAI | Auth0Easily implement secure login experiences for AI Agents - from interactive chatbots to background workers with Auth0. Auth for GenAI is now available in Developer Preview
-
5
Jimp
An image processing library written entirely in JavaScript for Node
An image processing library for Node written entirely in JavaScript, with zero native dependencies. If you're using this library with TypeScript the method of importing slightly differs from JavaScript. Instead of using require, you must import it with ES6 default import scheme. If you're using a web bundles (webpack, rollup, parcel) you can benefit from using the module build of jimp. Using the module build will allow your bundler to understand your code better and exclude things you aren't... -
6
Apache brpc
Industrial-grade RPC framework used throughout Baidu
... is not necessarily a reflection of the completeness or stability of the code, it does indicate that the project has yet to be fully endorsed by the ASF. brpc is an industrial-grade RPC framework for building reliable and high-performance services. Build HA distributed services using an industrial-grade implementation of RAFT consensus algorithm which is opensourced at braft. -
7
PHP Snowflake
An ID Generator for PHP based on Snowflake Algorithm
An ID Generator for PHP based on Snowflake Algorithm (Twitter announced). Snowflake is a network service that generates unique ID numbers at high scale with simple guarantees. If you want to generate unique IDs using the snowflake algorithm, you must ensure that sequence numbers generated within the same millisecond on the same node are unique. Based on this requirement, we have created this package which integrates multiple sequence number providers. -
8
harmonypy
Integrate multiple high-dimensional datasets with fuzzy k-means
Harmony is an algorithm for integrating multiple high-dimensional datasets. harmonypy is a port of the harmony R package by Ilya Korsunsky. Harmony is a general-purpose R package with an efficient algorithm for integrating multiple data sets. It is especially useful for large single-cell datasets such as single-cell RNA-seq. -
9
openTSNE
Extensible, parallel implementations of t-SNE
openTSNE is a modular Python implementation of t-Distributed Stochasitc Neighbor Embedding (t-SNE) [1], a popular dimensionality-reduction algorithm for visualizing high-dimensional data sets. openTSNE incorporates the latest improvements to the t-SNE algorithm, including the ability to add new data points to existing embeddings [2], massive speed improvements [3] [4] [5], enabling t-SNE to scale to millions of data points, and various tricks to improve the global alignment of the resulting... -
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
FSRS4Anki
A modern Anki custom scheduling based on Free Spaced Repetition
A modern spaced-repetition scheduler for Anki based on the Free Spaced Repetition Scheduler algorithm. -
11
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. -
12
jekyll-tagging-related_posts
Jekyll `related_posts` function based on tags
Jekyll related_posts function based on tags (works on Jekyll3). It replaces the original Jekyll's related_posts function to use tags to calculate relationships. The calculation algorithm is based on related_posts-jekyll_plugin. -
13
zvt
Modular quant framework
For practical trading, a complex algorithm is fragile, a complex algorithm building on a complex facility is more fragile, complex algorithm building on a complex facility by a complex team is more and more fragile. zvt wants to provide a simple facility for building a straightforward algorithm. Technologies come and technologies go, but market insight is forever. Your world is built by core concepts inside you, so it’s you. zvt world is built by core concepts inside the market, so it’s zvt... -
14
Alink
Alink is the Machine Learning algorithm platform based on Flink
Alink is Alibaba’s scalable machine learning algorithm platform built on Apache Flink, designed for batch and stream data processing. It provides a wide variety of ready-to-use ML algorithms for tasks like classification, regression, clustering, recommendation, and more. Written in Java and Scala, Alink is suitable for enterprise-grade big data applications where performance and scalability are crucial. It supports model training, evaluation, and deployment in real-time environments... -
15
R1-V
Witness the aha moment of VLM with less than $3
R1-V is an initiative aimed at enhancing the generalization capabilities of Vision-Language Models (VLMs) through Reinforcement Learning in Visual Reasoning (RLVR). The project focuses on building a comprehensive framework that emphasizes algorithm enhancement, efficiency optimization, and task diversity to achieve general vision-language intelligence and visual/GUI agents. The team's long-term goal is to contribute impactful open-source research in this domain. -
16
WAFW00F
WAFW00F allows one to identify and fingerprint Web App Firewall
The Web Application Firewall Fingerprinting Tool. Sends a normal HTTP request and analyses the response; this identifies a number of WAF solutions. If that is not successful, it sends a number of (potentially malicious) HTTP requests and uses simple logic to deduce which WAF it is. If that is also not successful, it analyses the responses previously returned and uses another simple algorithm to guess if a WAF or security solution is actively responding to our attacks. For further details, check... -
17
TextDistance
Compute distance between sequences
Python library for comparing the distance between two or more sequences by many algorithms. For main algorithms, text distance try to call known external libraries (fastest first) if available (installed in your system) and possible (this implementation can compare this type of sequences). Install text distance with extras for this feature. Textdistance use benchmark results for algorithm optimization and try to call the fastest external lib first (if possible). TextDistance show benchmarks... -
18
Clustering.jl
A Julia package for data clustering
Methods for data clustering and evaluation of clustering quality. -
19
IGListKit
A data-driven UICollectionView framework for building fast lists
IGListKit uses an algorithm adapted from a paper titled A technique for isolating differences between files by Paul Heckel. This algorithm uses a technique known as the longest common subsequence to find a minimal diff between collections in linear time O(n). It finds all inserts, deletes, updates, and moves between arrays of data. A working range is a range of section controllers who aren’t yet visible, but are near the screen. Section controllers are notified of their entrance and exit... -
20
IK Analysis for Elasticsearch
A plugin that integrates Lucene IK analyzer into elasticsearch
..., independent of the Lucene project, and at the same time provides a default optimized implementation of Lucene. In the 2012 version, IK implemented a simple word segmentation ambiguity elimination algorithm, marking the evolution of the IK tokenizer from pure dictionary word segmentation to analog semantic word segmentation. -
21
ZhParser
PostgreSQL extension for full-text search of Chinese language
zhparser is a PostgreSQL extension for full-text search of Chinese text. It integrates with PostgreSQL's text search engine to tokenize Chinese characters using a dictionary-based segmentation algorithm. zhparser is a valuable tool for improving search accuracy and performance in Chinese-language applications. -
22
nkn
Official Go implementation of NKN full node
NKN (New Kind of Network) is a blockchain-based network infrastructure that utilizes a novel consensus mechanism to facilitate decentralized data transmission. By incentivizing network participants with tokens, NKN aims to create a more open, efficient, and secure internet. Its architecture supports a wide range of applications, from messaging to content delivery. -
23
BasicBSpline.jl
Basic (mathematical) operations for B-spline functions
Basic (mathematical) operations for B-spline functions and related things with Julia. -
24
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. -
25
DecisionTree.jl
Julia implementation of Decision Tree (CART) Random Forest algorithm
Julia implementation of Decision Tree (CART) and Random Forest algorithms.
