Search results

{{Short description|Database of endangered languages}} ...nguages]] of the world. It is available to the public via the [[Endangered Languages Project]] [http://www.endangeredlanguages.com website]. ...

{{Short description|Concept in machine learning}} ...ence]], related to [[passive learning]]. In passive learning, an inference algorithm <math>I</math> is given a set of pairs of strings and labels <math>S</math> ...

{{Short description|Sorting algorithm}} ..., and Sridhar Ramachandran in 1999 in the context of the [[Cache-oblivious algorithm|cache oblivious model]].<ref>M. Frigo, C.E. Leiserson, H. Prokop, and S. Ra ...

{{Short description|Task scheduling algorithm}} '''Heterogeneous earliest finish time''' ('''HEFT''') is a [[heuristic algorithm]] to schedule a set of dependent tasks onto a network of [[heterogeneous co ...

{{Short description|Algorithm to transform a regular expression into a finite automaton}} ...o [[pattern matching|match strings]] against the regular expression. This algorithm is credited to [[Ken Thompson]]. ...

{{short description|Method in computational linguistics}} ..." and the "one sense per discourse" properties of [[natural language|human languages]] for word sense disambiguation. From observation, words tend to exhibit on ...

{{Short description|Function defined on formal languages in computer science}} ...1}S</math> of a [[set (mathematics)|set]] <math>S</math> of [[word (formal languages)|strings]] and a string <math>u</math> is the set of all strings obtainable ...

Let <math>L</math> be the set of words over the [[Alphabet (formal languages)|alphabet]] {''a'',''b''} whose ''n''th last letter is an <math>a</math>. T Let ''A'' and ''B'' be two UFAs. Let ''L''(''A'') and ''L''(''B'') be the languages accepted by those automata. Then ''L''(''A'')⊆''L''(''B'') if and only if ' ...

{{Short description|Algorithmic problem with applications to program analysis}} ...am analysis]]. Given a graph with edge labels from some [[Alphabet (formal languages)|alphabet]] and a [[context-free grammar]] over that alphabet, the problem ...

{{Short description|Online Judge System}} ...to problems can be submitted in over 40 programming [[programming language|languages]], including esoteric ones, via the Sphere Engine. It is run by the Polish ...

{{Short description|Structure of a formal language}} {{Formal languages}} ...

...rent decompositions into codewords. As [[Donald Knuth|Knuth]] reports, the algorithm was rediscovered about ten years later in 1963 by [[Robert W. Floyd|Floyd]] ==Idea of the algorithm== ...

{{Short description|Task of transforming a deterministic finite automaton}} ...nown as final) states. Reachable states can be obtained with the following algorithm: ...

{{Short description|Quantum algorithm for counting solutions to search problems}} The '''Quantum counting algorithm''' is a [[quantum algorithm]] for efficiently counting the number of solutions for a given search probl ...

{{short description|Authenticated encryption mode with resistance against nonce reuse}} ...rchive-date=2023-11-18 | title=How we optimized the AES-GCM-SIV encryption algorithm }}</ref> ...

{{Short description|Mathematical problems devised by John Conway}} ...ng|300px|thumb|right|A Topswops example with <math>N=5</math> numbers. The algorithm ends after 7 iterations.]] ...

{{Short description|Connectivity measure in graph theory}} ...ime <math>O^*(2^n)</math> on general digraphs. There is an [[approximation algorithm]] with approximation ratio <math>O((\log n)^\frac32)</math>. ...

{{Short description|Open-source machine learning system for end-to-end data science lifecycle}} # Algorithm customizability via R-like and Python-like languages. ...

{{Short description|Formal semantics of logic programming languages}} ...tics of the purely [[Declarative programming|declarative]] subset of these languages. Confusingly, the name "logic programming" also refers to a {{em|specific}} ...

{{Short description|Set of strings with few differences}} ...ng (computer science)|string]] <math>x</math> over some [[Alphabet (formal languages)|alphabet]] (often the alphabet {0,1}) is the set of all strings of the sam ...