Search Results for "search" - Page 2
Sort By:
Showing 76 open source projects for "search"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
AhoCorasickDoubleArrayTrie
An extremely fast implementation of Aho Corasick algorithm
AhoCorasickDoubleArrayTrie is a Java implementation of the Aho–Corasick multi-pattern matching algorithm that is optimized using a Double-Array Trie data structure. It is designed for fast keyword scanning across large texts, where you want to search for many patterns simultaneously and efficiently. The core idea is to build an automaton from a dictionary of patterns, then stream through input text to emit matches with minimal overhead. By using a double-array trie representation, the project emphasizes performance and memory efficiency compared to simpler pointer-heavy trie structures, which can matter a lot for large dictionaries or latency-sensitive services. ... -
2
mssolutions
Makes magic squares.
These programs make magic squares and rectangles using "Constraint-Based Local Search". (For non-square rectangles, input the order as two numbers.) There are 3 similar programs: CompleteSquare, CompleteSquareSteps, and MagicSquares. Given an input square with some cell values between 1 and NxN specified, (and other cell values 0), CompleteSquare attempts to complete a magic square by placing the remaining values. -
3
libtdata
Libtdata is a C library implements trees, index allocation and bit ops
Libtdata is a small and portable C library implements a set of various search data structures, bit operations and index allocation. -
4
Data Algorithm/leetcode/lintcode
Data Structure and Algorithm notes
This work is some notes of learning and practicing data structures and algorithms. Part I is a brief introduction of basic data structures and algorithms, such as, linked lists, stack, queues, trees, sorting and etc. This book notes about learning data structure and algorithms. It was written in Simplified Chinese but other languages such as English and Traditional Chinese are also working in progress. -
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.
-
5
SMSD
SMSD is a Java based software library for calculating MCS.
SMSD is a Java based software library for calculating Maximum Common Subgraph (MCS) between small molecules. This will help us to find similarity/distance between two molecules. MCS is also used for screening drug like compounds by hitting molecules, which share common subgraph (substructure). -
6
NOMAD is a C++ code that implements the MADS algorithm (Mesh Adaptive Direct Search) for difficult blackbox optimization problems. Such problems occur when the functions to optimize are costly computer simulations with no derivatives.
-
7
MultiFast
Mass String Search and Replace Solution via Aho-Corasick Algorithm
Multifast provides you with efficient library and tool, to search and manipulate data streams on the fly. It can search for a huge number of strings and replace them in one pass. It contains a tidy and efficient implementation of the Aho-Corasick algorithm as a C library. -
8
algorithms.js
Classic algorithms and data structures implemented in JavaScript
Traditional Computer Science algorithms and data structures implemented in JavaScript. Algorithms such as collatzConjecture, extendedEuclidean, fastPower, fibonacci, findDivisors, fisherYates, gcd (Greatest common divisor), greatestDifference, lcm (Least common multiple), newtonSqrt, nextPermutation, powerSet, reservoirSampling, shannonEntropy, etc. -
9
Primes
Calculate primes by using extremely fast sorting
This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for... -
Stop Cyber Threats with VM-Series Next-Gen Firewall on AzureGain integrated visibility across all traffic in a single pass. Deploy Palo Alto Networks VM-Series to determine application identity and content while automating security policy updates via rich APIs.
-
10
OptimC
OptimC - Optimization / Unconstrained Minimization Library in ANSI C
OptimC is a C software package to minimize any unconstrained multivariable function. The algorithms implemented are Nelder-Mead,Newton Methods (Line Search and Trust Region methods), Conjugate Gradient and BFGS (regular and Limited Memory). Brent method is also available for single variable functions if the bounds are known. Update 06/09/2014 - Nonlinear Squares Implementation [Levenberg-Marquardt Method] Added. Documentation - http://code.google.com/p/optimc/ -
11
SourceAFIS
Fingerprint recognition library (.NET port)
SourceAFIS is a software library for human fingerprint recognition. It can compare two fingerprints 1:1 or search a large database for matching fingerprint. It takes raw fingerprint images on input and produces matching score on output. Click the website link above for more info. -
12
SEO & SEM - Marketing Text Writer
Open Source SEO & SEM Text Creation Tools for free Article Writer
Open Source Tool for Search Engine Optimization (SEO & SEM) used for automatic content processing. These SEO Content Genrators and Article Writers based on Text Writer: https://www.artikelschreiber.com/en/ https://www.unaique.net/en/ https://www.unaique.com/ https://www.artikelschreiben.com/ https://www.buzzerstar.com/ https://googleduplicatecontentsolver.sourceforge.io/ https://inkassos.github.io/inkasso/ https://www.artikelschreiber.com/opensource/ https://www.sebastianenger.com/ https://www.artikelschreiber.com/marketing/review/ https://muckrack.com/markus-muller https://linktr.ee/textgenerator Code Contains: - Perl Source code, language databases and more -
13
CLAW is a C++ Library providing various tools in different domains, like a Tweener framework, Bézier curves manipulation, a map with multiple value types, a binary search tree container implemented as an AVL and an implementation of the sockets as std::stream. The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats. Finally, a part of the library is devoted to artificial intelligence in games and includes a generic alpha-beta algorithm. ...
-
14
Levenshtein distance Java Libarary
Java library implementing Levensh distnce
-
15
Shobhit-Improved String Search
SHOBHIT-Improved String Search is new improved string search algorithm
In Computer Science, SHOBHIT-Improved String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in August, 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first, last, mid1 and mid2 index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. -
16
SHOBHIT-Advance String Search
SHOBHIT-Advance String Search is a pattern search Algorithm
In Computer Science, SHOBHIT-Advance String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first and last index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/2) and in worst case, time complexity is O(n – (m/2) ). -
17
tway
moved to https://github.com/sroycode/tway
Currently two way astar is implemented. For those interested I have uploaded a patch of this for pgrouting v1.05 moved to https://github.com/sroycode/tway -
18
Search Agents - a framework for collaboration of meta-heuristic agents
-
19
php-url-extractor
List al URLs present in requested URL in absolute format
This php program extracts all URLs present on the requested URL, in absolute path. -
20
Asteroid
A CBLS Engine in SCALA, NOW part of OscaR
Asteroid has been merged with Scampi, to give rise to OScar. Follow us on https://bitbucket.org/oscarlib/oscar/wiki/Home Asteroid offers a powerful framework for developing constraint-based local search solution to combinatorial problems. This technique provides good scalability to real-world problems. It includes a library of standard constraints and invariants to declaratively define the problem you want to solve, and it also provides powerful search mechanisms. -
21
ssSearchEngine
keyword search engine for semi-structured data (Tables, lists,...)
This application implement an approach for doing keyword based search over semi-structured data available in HTML pages. -
22
Simple Fast Dictionary
Simple, small and fast dictionary lib on C
The library does quick search of dictionary words in arbitrary input strings. Known problems are known. :) See appropriate section in documentation. Also, only ASCII words and strings for now. -
23
gpufsknn
A GPU-based efficient data parallel formulation of the kNN problem
A GPU-based efficient data parallel formulation of the k-Nearest Neighbor (kNN) search problem which is a popular method for classifying objects in several fields of research, such as- pattern recognition, machine learning, bioinformatics etc. -
24
Coupling the notion that during the search for the minimum of a function we must pass through its solution with a PSO solution generator engine, is the approach for solving, in time domain, a non-linear algebric-differential system of equations.
-
25
Fast search using a standard SQL on Oracle or PostgreSQL database. The package includes the database creator, loader and web application. It supports SMILES and SMARTS substructure searches, similarity search, stereochemistry.
