Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,587,460 papers from all fields of science
Search
Sign In
Create Free Account
Character encoding
Known as:
Coded character
, Character coding
, Coded Character Set
Expand
In computing, a character encoding is used to represent a repertoire of characters by some kind of an encoding system. Depending on the abstraction…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
50 relations
ASCII art
Adobe Atmosphere Community Server
Armenian alphabet
Backward compatibility
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
High Dynamic Range Imaging: Acquisition, Display, and Image-Based Lighting
E. Reinhard
,
G. Ward
,
S. Pattanaik
,
P. Debevec
,
W. Heidrich
,
K. Myszkowski
2010
Corpus ID: 60798437
Foreword Preface 1 Introduction 2 Light And Color 3 HDR Image Encodings 4 HDR Image Capture 5 Display Devices 6 The Human Visual…
Expand
Highly Cited
2005
Highly Cited
2005
Endomorphisms and automorphisms of the shift dynamical system
G. A. Hedlund
Mathematical systems theory
2005
Corpus ID: 21803927
Let X(Se) be the set of all bisequences over a symbol set 6 a, where 1 < card S# < 0% and let cr be the shift transformation. If…
Expand
Highly Cited
2003
Highly Cited
2003
The Base16, Base32, and Base64 Data Encodings
S. Josefsson
RFC
2003
Corpus ID: 5739143
This document describes the commonly used base 64, base 32, and base 16 encoding schemes. It also discusses the use of line-feeds…
Expand
Highly Cited
2000
Highly Cited
2000
Termites: Evolution, Sociality, Symbioses, Ecology
安部 琢哉
,
D. Bignell
,
東 正彦
Springer Netherlands
2000
Corpus ID: 30804981
Contributors. Acknowledgements. Preface. Taxonomy and Phylogeny of Termites S. Kambhampati, P. Eggleton. Global Patterns of…
Expand
Highly Cited
1996
Highly Cited
1996
Pushing the Envelope: Planning, Propositional Logic and Stochastic Search
Henry A. Kautz
,
B. Selman
AAAI/IAAI, Vol. 2
1996
Corpus ID: 5740182
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to…
Expand
Highly Cited
1995
Highly Cited
1995
Network security - private communication in a public world
C. Kaufman
,
R. Perlman
,
M. Speciner
Prentice Hall series in computer networking and…
1995
Corpus ID: 37316854
The classic guide to network securityi¾now fully updated!"Bob and Alice are back!"Widely regarded as the most comprehensive yet…
Expand
Highly Cited
1992
Highly Cited
1992
Fast text searching: allowing errors
Sun Wu
,
U. Manber
CACM
1992
Corpus ID: 9891396
T h e string-matching problem is a very c o m m o n problem. We are searching for a string P = PtP2. . "Pro i n s i d e a la rge…
Expand
Highly Cited
1990
Highly Cited
1990
Lex—a lexical analyzer generator
M. Lesk
,
E. Schmidt
1990
Corpus ID: 7900881
Lex helps write programs whose control flow is directed by instances of regular expressions in the input stream. It is well…
Expand
Highly Cited
1985
Highly Cited
1985
Applying Adaptive Algorithms to Epistatic Domains
L. Davis
IJCAI
1985
Corpus ID: 2752879
John Holland has shown that when adaptive algorithms are used to search certain kinds of extremely large problem spaces, they…
Expand
Highly Cited
1975
Highly Cited
1975
Depth of processing and the retention of words
F. Craik
,
E. Tulving
1975
Corpus ID: 7896617
SUMMARY Ten experiments were designed to explore the levels of processing framework for human memory research proposed by Craik…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE