Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,432,853 papers from all fields of science
Search
Sign In
Create Free Account
String (computer science)
Known as:
String-oriented
, String algorithm
, String data type
Expand
In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable. The latter may…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Address space
Apple Computer, Inc. v. Franklin Computer Corp.
Berman–Hartmanis conjecture
Bit array
Expand
Broader (1)
Character encoding
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2007
Review
2007
Finsler-Lagrange Geometries and Standard Theories in Physics: New Methods in Einstein and String Gravity
S. Vacaru
2007
Corpus ID: 14179769
In this article, we review the current status of Finsler-Lagrange geometry and generalizations. The goal is to aid non-experts on…
Expand
2002
2002
3D-List: A Data Structure for Efficient Video Query Processing
Chih-Chin Liu
,
Arbee L. P. Chen
IEEE Transactions on Knowledge and Data…
2002
Corpus ID: 12079208
A video query model based on the content of video and iconic indexing is proposed. We extend the notion of two-dimensional…
Expand
Highly Cited
2001
Highly Cited
2001
The Unknown Word Problem: a Morphological Analysis of Japanese Using Maximum Entropy Aided by a Dictionary
Kiyotaka Uchimoto
,
S. Sekine
,
H. Isahara
Conference on Empirical Methods in Natural…
2001
Corpus ID: 9862757
In this paper we describe a morphological analysis method based on a maximum entropy model. This method uses a model that can not…
Expand
Review
1992
Review
1992
Book Reviews: Generalized LR Parsing
Giorgio Satta
International Conference on Computational Logic
1992
Corpus ID: 14450188
Tomita's algorithm, also called the Generalized LR (GLR) parser, is a method for natural language parsing that extends standard…
Expand
1991
1991
Two extensions of the Viterbi algorithm
A. Bouloutas
,
G. Hart
,
M. Schwartz
IEEE Transactions on Information Theory
1991
Corpus ID: 29207980
The problem of minimum-cost correction of a corrupted set of data that has been generated by a known finite state machine (FSM…
Expand
Review
1990
Review
1990
An overview of head-driven bottom-up generation
Gertjan van Noord
1990
Corpus ID: 16533279
In this paper I will discuss the properties of a tactical generation approach that has become popular recently: head-driven…
Expand
1989
1989
Programming languages and lambda calculi
M. Felleisen
,
M. Flatt
1989
Corpus ID: 11542432
These are the basic thoughts that should go into the preface. It is not a final version. In a series of papers in the mid-1960's…
Expand
Highly Cited
1978
Highly Cited
1978
Hardware Algorithms for Nonnumeric Computation
A. Mukhopadhyay
IEEE transactions on computers
1978
Corpus ID: 7043044
This paper is concerned with the design of hardware algorithms for nonnumeric computation. The subset of nonnumeric operations…
Expand
1972
1972
Reproductive adaptive plans
D. J. Cavicchio
ACM Annual Conference
1972
Corpus ID: 6149987
This paper traces the experimental development of a new class of powerful and flexible adaptive plans, called reproductive plans…
Expand
1965
1965
A New Class of Selected Ternary Pulse Transmission Plans for Digital Transmission Lines
J. Sipress
1965
Corpus ID: 62187664
Digital transmission lines consisting of cable media and regularly spaced self-timed reconstructive repeaters are being…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE