Search Results for "algorithm"

Write programs as graphical dataflow charts instead of text. Compile them to any programming language you want. Besides this project includes the most efficient tree-based sorting algorithm that is possible. Originally developed on a CTOS Color NGEN, at first in Pascal, later ported to C, finally - 20 years later - ported to Linux. Currently it's still not really system independent. But it's intended that further releases will cure this.

Super Search revolutionizes file search! Find word documents, PDFs, and folders with lightning speed on your entire hard drive. Our intelligent algorithm ensures precise results, saving you time and effort. Enjoy unparalleled file format support and privacy, all in a user-friendly package. But that's not all! Super Search is your ticket to rediscovering lost treasures from the past. Whether it's an old work file, a cherished family memory, or any sentimental piece you thought was gone forever, Super Search will tirelessly hunt it down for you. ...

This package offers advanced functionality for searching and filtering data in Elasticsearch.

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 sorting any kind of data. ...

fuzzysearch is a tiny, blazing-fast fuzzy search library for JavaScript that checks whether a “needle” string can be found inside a “haystack” string in order, but not necessarily contiguously. It implements a simplified fuzzy searching algorithm that does not use Levenshtein distance; instead it returns a boolean indicating whether all characters of the needle appear in sequence within the haystack. This makes it ideal for filtering lists or autocomplete suggestions quickly based on incomplete user input. Because it operates with a very small algorithmic footprint, it is both lightweight in size and extremely fast in practice. ...

A high-performance implementation of bloom filters, a lightweight duplicate detection algorithm.

XLN Desktop Search is search engine for files and folders in your desktop. Using the KMP (Knuth-Morris-Pratt) string search algorithm makes it much faster. And it is so simple.

It's a stemmer for Spanish implemented in PHP (Based on Porter Algorithm) / Es un lexemador para español implementado en PHP (Basado en el algoritmo de Porter)

A light weight Desktop Search Application built in .net C# and Vb.net implemented using file search recursive algorithm and threads. provides explorer like view of files. It can be implemented in mono(platform independent).currently only runs on Microsoft Platform.

This is a network based text search tool. The Network part consists of Client and Server side .class files. The text search algorithm has been implemented in C. On client side type SearchClient ip(server) string

StrMatch is a simple java program, created for educational purposes, that allows user to test a great part of string matching algorithms. An intuitive user interface shows each algorithm step accurately...

An Open source Java library that implements the Extractor(Turner) Algorithm for keyphrases retrieval. This is an utility for summarizing.