Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,276,763 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.
Highly Cited
2013
Highly Cited
2013
A High-Efficiency Active Battery-Balancing Circuit Using Multiwinding Transformer
Siqi Li
,
C. Mi
,
Mengyang Zhang
IEEE transactions on industry applications
2013
Corpus ID: 13951130
This paper presents a simple circuit for balancing series-connected battery cells. The circuit is composed of one low-voltage…
Expand
Highly Cited
2007
Highly Cited
2007
Rishi: Identify Bot Contaminated Hosts by IRC Nickname Evaluation
Jan Göbel
,
Thorsten Holz
Conference on Workshop on Hot Topics in…
2007
Corpus ID: 1515077
In this paper, we describe a simple, yet effective method to detect bot-infected machines within a given network that relies on…
Expand
Highly Cited
2006
Highly Cited
2006
Intelligent PV Module for Grid-Connected PV Systems
E. Roman
,
R. Alonso
,
P. Ibañez
,
S. Elorduizapatarietxe
,
D. Goitia
IEEE transactions on industrial electronics…
2006
Corpus ID: 206697640
Most issues carried out about building integrated photovoltaic (PV) system performance show average losses of about 20%-25% in…
Expand
Review
2005
Review
2005
The broth in my brother ’ s brothel : Morpho-orthographic segmentation in visual word recognition
R. Holloway
2005
Corpus ID: 13795407
Morphologically complex words introduce a significant challenge to modern theories of visual word recognition. For over 25 years…
Expand
Highly Cited
2003
Highly Cited
2003
Fuzzy partitioning using a real-coded variable-length genetic algorithm for pixel classification
U. Maulik
,
S. Bandyopadhyay
IEEE Transactions on Geoscience and Remote…
2003
Corpus ID: 11912769
The problem of classifying an image into different homogeneous regions is viewed as the task of clustering the pixels in the…
Expand
Highly Cited
1997
Highly Cited
1997
Similarity Searching in Medical Image Databases
E. Petrakis
,
C. Faloutsos
IEEE Transactions on Knowledge and Data…
1997
Corpus ID: 6565978
We propose a method to handle approximate searching by image content in medical image databases. Image content is represented by…
Expand
Review
1990
Review
1990
Notes on topological string theory and 2-D quantum gravity
R. Dijkgraaf
,
E. Verlinde
,
H. Verlinde
1990
Corpus ID: 15808858
In these notes we give a review of topological string theory. We discuss twodimensional topological field theories, which…
Expand
Highly Cited
1988
Highly Cited
1988
Basic notions of trace theory
A. Mazurkiewicz
REX Workshop
1988
Corpus ID: 37934702
The concept of traces has been introduced for describing non-sequential behaviour of concurrent systems via its sequential…
Expand
Highly Cited
1983
Highly Cited
1983
Implicit Learning and Generalization of the "Mere Exposure" Effect
P. Gordon
,
K. Holyoak
1983
Corpus ID: 11685242
Two experiments are reported in which the generalization of the "mere exposure" effect is examined. Both experiments demonstrated…
Expand
Review
1962
Review
1962
Revised report on the algorithmic languageAlgol 60
J. Backus
,
F. L. Bauer
,
+10 authors
M. Woodger
Computer/law journal
1962
Corpus ID: 7853511
SummaryThe report gives a complete defining description of the international algorithmic languageAlgol 60. This is a language…
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