64 search results - page 9 / 13 » Compression of Partially Ordered Strings |
JSYML
2006
13 years 8 months ago
2006
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
ICIP
2008
IEEE
14 years 3 months ago
2008
IEEE
We propose a novel method to reduce both blocking and ringing artifacts in compressed images and videos. Based on the directional characteristics of ringing artifacts along edges,...
ANCS
2007
ACM
14 years 17 days ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
TRIDENTCOM
2006
IEEE
14 years 2 months ago
2006
IEEE
— To evaluate routing protocols on a controlled indoor wireless testbed, the radio range must be compressed so that larger multi-hop topologies can be mapped into a laboratorysiz...
MICAI
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we discuss tree kernels that can be applied for the classification of XML documents based on their DOM trees. DOM trees are ordered trees, in which every node might...