Median filtering is a commonly used technique in signal processing. Typically used on signals that may contain outliers skewing the usual statistical estimators, it is usually considered too expensive to be implemented in real-time or CPU-intensive applications.
More Information » Site Details | Report This Site
Web Address » http://ndevilla.free.fr/median/ |
Fibonaccian search, also referred to as Fibonacci search, is a divide-and-conquer algorithm for searching a sorted array by narrowing possible locations to progressively smaller intervals. These intervals are determined with the aid of the Fibonacci numbers.
More Information » Site Details | Report This Site
Web Address » http://www.ics.forth.gr/~lourakis/fibsrch/ |
Fuzzy or, in other words, approximate searching means finding similar objects. That is the answer to the query may contain not only exact match but also objects that have something in common with a query object. These objects are very diverse: addresses, names, text snippets, n-dimensional space points and geometric figures.
More Information » Site Details | Report This Site
Web Address » http://itman.narod.ru/english/ir/index.html |
Resources on the Levenshtein Algorithm for fault-tolerant search. Website contains online-demos and efficient implementations.
More Information » Site Details | Report This Site
Web Address » http://www.levenshtein.net/ |
A search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer scientists that solve problems are kinds of search algorithms.
More Information » Site Details | Report This Site
Web Address » http://en.wikipedia.org/wiki/Search_algorithm |
Searching algorithms are closely related to the concept of dictionaries. Dictionaries are data structures that support search, insert, and delete operations. One of the most effective representations is a hash table. Typically, a simple function is applied to the key to determine its place in the dictionary.
More Information » Site Details | Report This Site
Web Address » http://www.softpanorama.org/Algorithms/searching.shtml |
String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text.
More Information » Site Details | Report This Site
Web Address » http://en.wikipedia.org/wiki/String_searching_algorithm |
| | |
