Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,394,724 papers from all fields of science
Search
Sign In
Create Free Account
Entropy estimation
In various science/engineering applications, such as independent component analysis, image analysis, genetic analysis, speech recognition, manifold…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Differential entropy
Entropy (information theory)
Entropy power inequality
Image analysis
Expand
Broader (3)
Information theory
Random number generation
Randomness
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The structure and components of embedded special processors for determination of entropy signals and random messages
S. Melnychuk
,
A. Voronych
,
L. Nykolaychuk
,
B. Krulikovskyi
XIIIth International Conference on Perspective…
2017
Corpus ID: 44186693
Theoretical bases, methods and special processor tools for determination entropy of random messages and signals are described…
Expand
2016
2016
An Entropy Estimator Based on Polynomial Regression with Poisson Error Structure
H. Hino
,
S. Akaho
,
Noboru Murata
International Conference on Neural Information…
2016
Corpus ID: 5989
A method for estimating Shannon differential entropy is proposed based on the second order expansion of the probability mass…
Expand
2013
2013
Cooperative spectrum sensing under noisy control channel for Cognitive Radio Network
S. Srinu
,
S. Sabat
,
S. Udgata
National Conference on Communications
2013
Corpus ID: 37948977
Spectrum sensing is a vital phase in Cognitive Radio (CR) to identify the unutilized spectrum for improving the spectrum…
Expand
Review
2007
Review
2007
Recursive Hashing and One-Pass, One-Hash n-Gram Count Estimation
D. Lemire
,
Owen Kaser
arXiv.org
2007
Corpus ID: 7428740
Many applications use sequences of n consecutive symbols (n-grams). We review n-gram hashing and prove that recursive hash…
Expand
2006
2006
A general compression algorithm that supports fast searching
K. Fredriksson
,
S. Grabowski
Information Processing Letters
2006
Corpus ID: 14825250
2006
2006
String kernels and similarity measures for information retrieval
André F. T. Martins
2006
Corpus ID: 17495286
Measuring a similarity between two strings is a fundamental step in many applications in areas such as text classification and…
Expand
2005
2005
Automated data extraction from the web with conditional models
X. Phan
,
S. Horiguchi
,
T. Ho
International Journal of Business Intelligence…
2005
Corpus ID: 17951124
Extracting data on the Web is an important information extraction task. Most existing approaches rely on wrappers which require…
Expand
2002
2002
Beyond second-order statistics for learning: A pairwise interaction model for entropy estimation
Deniz Erdoğmuş
,
J. Príncipe
,
K. Hild
Natural Computing
2002
Corpus ID: 12578577
Second order statistics have formed the basisof learning and adaptation due to its appealand analytical simplicity. On the other…
Expand
2000
2000
Information Complexity of Laminar Chaotic Mixing Field Produced by Two Parallel, Rotating Cylinders
T. Takigawa
,
N. Ohmura
,
Kentaro Yagyuu
,
K. Kataoka
2000
Corpus ID: 55679646
The purpose of the present work is to numerically analyze information complexity of the laminar chaotic mixing field produced by…
Expand
1998
1998
Context tables: a tool for describing text compression algorithms
H. Yokoo
Proceedings DCC '98 Data Compression Conference…
1998
Corpus ID: 35253949
This paper introduces the notion of a context table, which is a common basis for describing and analyzing text compression…
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