Results 231 to 240 of about 35,764 (255)
Some of the next articles are maybe not open access.
The String-to-String Correction Problem
Journal of the ACM, 1974The string-to-string correction problem is to determine the distance between two strings as measured by the minimum cost sequence of “edit operations” needed to change the one string into the other. The edit operations investigated allow changing one symbol of a string into another single symbol, deleting one symbol
Robert A Wagner +2 more
exaly +3 more sources
On a cyclic string-to-string correction problem
Information Processing Letters, 1990zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
An Extension of the String-to-String Correction Problem
Journal of the ACM, 1975The string-to-string correction problem asks for a sequence S of "edit operations" of minimal cost such that ~(A) = B, for given strings A and B. The edit operations previously investi- gated allow changing one symbol of a string into another single symbol, deleting one symbol from a string, or inserting a single symbol into a string.
Robert A Wagner, Wagnerrobert A
exaly +3 more sources
A String Correction Algorithm for Cursive Script Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1982This paper deals with a method of estimating a correct string X from its noisy version Y produced by a cursive script recognition system. An accurate channel model that allows for splitting, merging, and substitution of symbols is introduced. The best estimate X is obtained by using a dynamic programming search which combines a known search strategy ...
Sargur N Srihari
exaly +3 more sources
Cosmic strings with curvature corrections
Physical Review D, 1992A generic model of string described by a Lagrangian density that depends on the extrinsic curvature of the string worldsheet is studied. Using a system of coordinates adapted to the string world sheet the equation of motion and the energy-momentum tensor are derived for strings evolving in curved spacetime.
, Boisseau, , Letelier
openaire +2 more sources
Fast string correction with Levenshtein automata
International Journal on Document Analysis and Recognition, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klaus U. Schulz, Stoyan Mihov
openaire +2 more sources
International Journal of Modern Physics A, 2010
In this paper we are considering coorections to strong interactions which are due to colored string Regge excitations. In case of a low string scale within the TeV region these higher spin excitations of quarks and gluons will lead to spectacular, universal dijet signatures at the LHC, which are true for a large class of models in the string landscape.
openaire +2 more sources
In this paper we are considering coorections to strong interactions which are due to colored string Regge excitations. In case of a low string scale within the TeV region these higher spin excitations of quarks and gluons will lead to spectacular, universal dijet signatures at the LHC, which are true for a large class of models in the string landscape.
openaire +2 more sources
On the complexity of the Extended String-to-String Correction Problem
Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75, 1975The Extended String-to-String Correction Problem [ESSCP] is defined as the problem of determining, for given strings A and B over alphabet V, a minimum-cost sequence S of edit operations such that S(A) = B. The sequence S may make use of the operations: Change, Insert, Delete and Swaps, each of constant cost WC, WI, WD, and WS respectively.
openaire +1 more source
Quantum corrections to the bosonic-string spectrum
Physical Review D, 1992Quantum corrections to the tachyon amplitude are computed perturbatively using Polyakov's method of quantization for the bosonic string. The tachyonic pole is eliminated for dimension {ital D}{ge}13.
, Marino, , Takakura
openaire +2 more sources
Delta technique and string-to-string correction
2006Delta technique is used to store versions of programs or other data economically in revision control systems. In recent revision control systems deltas are computed by compare programs, using lines as atomic symbols. In this paper a method is presented which, in contrast, uses characters as atomic symbols.
openaire +1 more source

