Sciweavers

29 search results - page 4 / 6
» A Strange Application of Kolmogorov Complexity
Sort
View
TCS
2008
13 years 9 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
APAL
2010
85views more  APAL 2010»
13 years 10 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
WSC
1998
13 years 11 months ago
Development and Application of a Validation Framework for Traffic Simulation Models
This paper discusses the concept of validation and proposes a multistage validation framework for traffic simulation models. The framework consists of conceptual validation and op...
Lei Rao, Larry E. Owen, David Goldsman
IWIA
2006
IEEE
14 years 3 months ago
An Application of Information Theory to Intrusion Detection
Zero-day attacks, new (anomalous) attacks exploiting previously unknown system vulnerabilities, are a serious threat. Defending against them is no easy task, however. Having ident...
E. Earl Eiland, Lorie M. Liebrock
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
13 years 11 months ago
A Compression Based Distance Measure for Texture
The analysis of texture is an important subroutine in application areas as diverse as biology, medicine, robotics, and forensic science. While the last three decades have seen ext...
Bilson J. L. Campana, Eamonn J. Keogh