Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,276,776 papers from all fields of science
Search
Sign In
Create Free Account
MDL (programming language)
Known as:
MDL
, MDL programming language
MDL (the MIT Design Language) is a descendant of the Lisp programming language. Its initial purpose was to provide high level language support for…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Actor model
Common Lisp
History of the Scheme programming language
Incompatible Timesharing System
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Analysis of changepoint models.
I. Eckley
,
P. Fearnhead
,
Rebecca Killick
2011
Corpus ID: 4663865
Highly Cited
2010
Highly Cited
2010
Surface stereo with soft segmentation
M. Bleyer
,
C. Rother
,
Pushmeet Kohli
IEEE Computer Society Conference on Computer…
2010
Corpus ID: 206591137
This paper proposes a new stereo model which encodes the simple assumption that the scene is composed of a few, smooth surfaces…
Expand
Highly Cited
2007
Highly Cited
2007
A linear-time algorithm for computing the multinomial stochastic complexity
P. Kontkanen
,
P. Myllymäki
Information Processing Letters
2007
Corpus ID: 36061654
Highly Cited
2005
Highly Cited
2005
Context tree estimation for not necessarily finite memory processes, via BIC and MDL
I. Csiszár
,
Zsolt Talata
IEEE Transactions on Information Theory
2005
Corpus ID: 7542685
The concept of context tree, usually defined for finite memory processes, is extended to arbitrary stationary ergodic processes…
Expand
Highly Cited
2002
Highly Cited
2002
Detection of sources using bootstrap techniques
R. Brcich
,
A. Zoubir
,
P. Pelin
IEEE Transactions on Signal Processing
2002
Corpus ID: 31364858
Source detection in array processing can be viewed as a test for equality of eigenvalues. Such a test is proposed, based on a…
Expand
Highly Cited
1999
Highly Cited
1999
Content-based hierarchical classification of vacation images
Aditya Vailaya
,
Mário A. T. Figueiredo
,
Anil K. Jain
,
HongJiang Zhang
Proceedings IEEE International Conference on…
1999
Corpus ID: 8262367
Grouping images into (semantically) meaningful categories using low level visual features is a challenging and important problem…
Expand
Highly Cited
1999
Highly Cited
1999
Using Evolutionary Programming and Minimum Description Length Principle for Data Mining of Bayesian Networks
M. Wong
,
Wai Lam
,
K. Leung
IEEE Transactions on Pattern Analysis and Machine…
1999
Corpus ID: 18293423
We have developed a new approach to learning Bayesian network structures based on the minimum description length (MDL) principle…
Expand
Highly Cited
1994
Highly Cited
1994
Simultaneous noise suppression and signal compression using a library of orthonormal bases and the minimum-description-length criterion
N. Saito
Defense, Security, and Sensing
1994
Corpus ID: 51543586
We describe an algorithm to estimate a discrete signal from its noisy observation, using a library of orthonormal bases…
Expand
Highly Cited
1993
Highly Cited
1993
ARMA model order estimation based on the eigenvalues of the covariance matrix
G. Liang
,
Mitchell Wilkes
,
J. Cadzow
IEEE Transactions on Signal Processing
1993
Corpus ID: 1905292
An approach to model order determination based on the minimum description length (MDL) criterion is proposed and shown to depend…
Expand
Highly Cited
1990
Highly Cited
1990
On information theoretic criteria for determining the number of signals in high resolution array processing
K. M. Wong
,
Qitu Zhang
,
J. Reilly
,
P. Yip
IEEE Transactions on Acoustics Speech and Signal…
1990
Corpus ID: 28230839
An important problem in high-resolution array processing is the determination of the number of signals arriving at the array…
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