Search Results for "base64.java" - Page 5
Sort By:
Showing 444 open source projects for "base64.java"
View related business solutions-
Simplify IT and security with a single endpoint management platformNinjaOne automates the hardest parts of IT, delivering visibility, security, and control over all endpoints for more than 20,000 customers. The NinjaOne automated endpoint management platform is proven to increase productivity, reduce security risk, and lower costs for IT teams and managed service providers. The company seamlessly integrates with a wide range of IT and security technologies. NinjaOne is obsessed with customer success and provides free and unlimited onboarding, training, and support.
-
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.
-
1
AlgART Java Libraries
Open source library for processing arrays and matrices
AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over matrices... -
2
Linking AnalyzerTask for iQser GIN
niPRO AnalyzerTask to calculate link popularity
AnalyzerTask to calculate the link popularity (SIN LP) for ContentObjects integrated into the iQser GinServer. Developed by niPRO-Project. -
3
Bin Packing with Genectic Algorithm
Bin Packing problem solved using Genectic Algorithm
This project contains a solution for a Bin Packing problem solved using Genectic Algorithms. The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007. -
4
Image Sorter
A visual animated demonstration of two sorting algorithms
An applet designed to demonstrate visually the steps taken by two sorting algorithms -- Insertion sort and Selection sort. -
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.
-
5
An optimized java library for genetic algorithms. The library is designed to be fast and memory light, but still very easy to use.
-
6
Funnel Sort
command line sort utility
Moved to GitHub https://github.com/fedups A command-line utility to sort files. Funnel is a sort utility to sort files, large and small. It efficiently handles fixed length records and variable length records. Funnel easily handles ascii (readable) data and binary data. There are many more features in Funnel. It is easy to use and very fast. All documentation is on the Wiki. -
7
Levenshtein distance Java Libarary
Java library implementing Levensh distnce
-
8
algebrain
Math Parser for Java
Moved to GitHub https://github.com/fedups Algebraic equation processing at run time for Java programs. Supports variables, functions with parameters, rate table lookups, an embedded "if" function... Infinitely extensible, very small footprint. -
9
Damerau Levenshtein
Java Library for Damerau Levenshtein Algorithm
-
Powering the best of the internet | FastlyEnsure your websites, applications and services can effortlessly handle the demands of your users with Fastly. Fastly’s portfolio is designed to be highly performant, personalized and secure while seamlessly scaling to support your growth.
-
10
Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml
-
11
Programming Accessory Kit
PAK is a collection of library code to handle the overhead of coding
PAK is a collection of library code to handle the overhead of coding things like read-write locks, reflective multithreaded programming and simple file io. This is a java library collection, please see my API below... -
12
-
13
JSolutions
The solution to all your problems
The Jsolution package is a collection of programs, scripts,libraries and documents that i have written and use in my daily life. -
14
-
15
-
16
Technical analysis library with indicators like ADX, MACD, RSI, Stochastic, TRIX... includes also candlestick pattern recognition. Useful for trading application developpers using either Excel, .NET, Mono, Java, Perl or C/C++.
-
17
-
18
Java Combinatorial Optimization Platform is used to solve combinatorial problems using common interface, providing means to easily add new algorithms and problems and to benchmark them.
-
19
Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity...
-
20
Mouse Run
Programming Game, A Practice Tool for Building Intelligent Things
Mouse Run is a programming game where programmers can implement a mouse and let it run in a maze to hunt of cheese. It is a battle among programmers to test who can build the most intelligent mouse, given limited information during the game. Programmers need only implement one code file, extending from an abstract class that will contain the logic of the individual mouse. The game Host will gather all the mouse implementation and let them run in the maze. It is real fun for... -
21
Rating AnalyzerTask for iQser GIN
niPRO AnalyzerTask to calculate the rate popularity
AnalyzerTask for calculating the rate popularity for ContentObjects integrated into the iQser GinServer. Developed by niPRO-Project. -
22
Signavio AnalyzerTask for iQser GIN
niPRO Signavio Process BPMN 2.0 AnalyzerTask
AnalyzerTask for Signavio BPMN Processes integrated into iQser GinServer. Developed by niPRO-Project. -
23
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
..., the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). This Java implementation implements our ASM algorithm. See README file: https://sourceforge.net/projects/asmalgorithm/files/ If you use our ASM implementation to support academic research, please cite the following paper: Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. Approximate Subgraph Matching-based Literature Mining for Biomedical Events and Relations. PLOS ONE, 8:4 e60954, 2013. -
24
quadGT
Software package for the joint genotyping
quadGT is a software package for the joint genotyping of two parents, child’s normal genome and child’s tumor genome based on sequencing reads aligned to a reference genome. -
25
A light-weight group communication system/library of distributed algorithms implementations for agreement problems (e.g., Consensus, Unreliable Leader Election and Atomic Broadcast).
