Search Results

160 articles with title/keywords/abstract containing Kolmogorov complexity

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Display per page 

Full Text

Author: Nies, André

Source: Computability and Randomness, January 2009 , pp. i-434(435)

Publisher: Oxford Scholarship Online Monographs

2. The descriptive complexity of strings

Author: Nies, André

Source: Computability and Randomness, January 2009 , pp. 74-102(29)

Publisher: Oxford Scholarship Online Monographs

On the complexity of system designs

Author: Reid, Darryn J.

Source: International Journal of Intelligent Defence Support Systems, Volume 1, Number 2, 11 December 2008 , pp. 130-149(20)

Publisher: Inderscience Publishers

Spam filtering using Kolmogorov complexity analysis

Authors: Richard, G.; Doncescu, A.

Source: International Journal of Web and Grid Services, Volume 4, Number 1, 25 May 2008 , pp. 136-148(13)

Publisher: Inderscience Publishers

Spam filtering using Kolmogorov complexity analysis

Authors: Richard, G.; Doncescu, A.

Source: International Journal of Web and Grid Services, Volume 4, Number 1, 25 May 2008 , pp. 136-148(13)

Publisher: Inderscience Publishers

Free Content Search Strategies in Structural Bioinformatics

Authors: Oakley, Mark T.; Barthel, Daniel; Bykov, Yuri; Garibaldi, Jonathan M.; Burke, Edmund K.; Krasnogor, Natalio; Hirst, Jonathan D.

Source: Current Protein and Peptide Science, Volume 9, Number 3, June 2008 , pp. 260-274(15)

Publisher: Bentham Science Publishers

Complexity for Extended Dynamical Systems

Authors: Bonanno, Claudio; Collet, Pierre

Source: Communications in Mathematical Physics, Volume 275, Number 3, November 2007 , pp. 721-748(28)

Publisher: Springer

On data mining, compression, and Kolmogorov complexity

Authors: Faloutsos, Christos; Megalooikonomou, Vasileios

Source: Data Mining and Knowledge Discovery, Volume 15, Number 1, August 2007 , pp. 3-20(18)

Publisher: Springer

Modeling individual multifactor estimation using GMDH elements and genetic algorithms

Authors: Ovezgel'dyev, A.; Petrov, K.

Source: Cybernetics and Systems Analysis, Volume 43, Number 1, January 2007 , pp. 126-133(8)

Publisher: Springer

Compression-based data mining of sequential data

Authors: Keogh, Eamonn; Lonardi, Stefano; Ratanamahatana, Chotirat; Wei, Li; Lee, Sang-Hee; Handley, John

Source: Data Mining and Knowledge Discovery, Volume 14, Number 1, February 2007 , pp. 99-129(31)

Publisher: Springer

Meaning Naturalism, Meaning Irrealism, and the Work of Language

Author: Delancey, Craig

Source: Synthese, Volume 154, Number 2, January 2007 , pp. 231-257(27)

Publisher: Springer

On the Motion Planning Problem, Complexity, Entropy, and Nonholonomic Interpolation

Authors: Gauthier, Jean-Paul; Zakalyukin, Vladimir

Source: Journal of Dynamical and Control Systems, Volume 12, Number 3, July 2006 , pp. 371-404(34)

Publisher: Springer

On the minimization of operational risks

Author: Maslov, V.

Source: Mathematical Notes, Volume 80, Numbers 3-4, September 2006 , pp. 539-541(3)

Publisher: Springer

A Bit Level Representation for Time Series Data Mining with Shape Based Similarity

Authors: Bagnall, Anthony; Ratanamahatana, Chotirat; Keogh, Eamonn; Lonardi, Stefano; Janacek, Gareth

Source: Data Mining and Knowledge Discovery, Volume 13, Number 1, July 2006 , pp. 11-40(30)

Publisher: Springer

Detecting Distributed Denial-of-Service Attacks Using Kolmogorov Complexity Metrics

Authors: Kulkarni, Amit; Bush, Stephen

Source: Journal of Network and Systems Management, Volume 14, Number 1, March 2006 , pp. 69-80(12)

Publisher: Springer

Nonreducible Descriptions for the Conditional Kolmogorov Complexity

Author: Ustinov, M.

Source: Problems of Information Transmission, Volume 41, Number 3, July 2005 , pp. 237-242(6)

Publisher: MAIK Nauka/Interperiodica

Finite problems and the logic of the weak law of excluded middle

Author: Chernov, A.

Source: Mathematical Notes, Volume 77, Numbers 1-2, January 2005 , pp. 263-272(10)

Publisher: Springer

Kolmogorov Complexity for Possibly Infinite Computations

Authors: Becher, Verónica; Figueira, Santiago

Source: Journal of Logic, Language and Information, Volume 14, Number 2, March 2005 , pp. 133-148(16)

Publisher: Springer

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A