Sciweavers

4355 search results - page 190 / 871
» Increasing Kolmogorov Complexity
Sort
View
DATE
2005
IEEE
96views Hardware» more  DATE 2005»
15 years 4 months ago
Framework for Fault Analysis and Test Generation in DRAMs
Abstract: With the increasing complexity of memory behavior, attempts are being made to come up with a methodical approach that employs electrical simulation to tackle the memory t...
Zaid Al-Ars, Said Hamdioui, Georg Mueller, A. J. v...
ICSM
2005
IEEE
15 years 4 months ago
Towards a Framework for Testing Structural Source-Code Regularities
As size and complexity of software systems increase, preserving the design and specification of their implementation structure gains importance in order to maintain the evolvabil...
Kim Mens, Andy Kellens
ACIVS
2005
Springer
15 years 4 months ago
Cleaning and Enhancing Historical Document Images
In this paper we present a recursive algorithm for the cleaning and the enhancing of historical documents. Most of the algorithms, used to clean and enhance documents or transform ...
Ergina Kavallieratou, Hera Antonopoulou
COCOON
2005
Springer
15 years 4 months ago
Randomized Quicksort and the Entropy of the Random Source
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
Beatrice List, Markus Maucher, Uwe Schöning, ...
COCOON
2005
Springer
15 years 4 months ago
Opportunistic Data Structures for Range Queries
Abstract In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of n k-bit integers, k ≤ O(log n), our data struct...
Chung Keung Poon, Wai Keung Yiu