Sciweavers

40 search results - page 4 / 8
» The Jump Classes of Minimal Covers
Sort
View
AMW
2010
13 years 9 months ago
Logic Programs for Repairing Inconsistent Dimensions in Data Warehouses
A Data Warehouse (DW) is a data repository that integrates data from multiple sources and organizes the data according to a set of data structures called dimensions. Each dimension...
Loreto Bravo, Mónica Caniupán Marile...
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
13 years 11 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
CSR
2010
Springer
13 years 10 months ago
Sofic and Almost of Finite Type Tree-Shifts
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
Nathalie Aubrun, Marie-Pierre Béal
TIFS
2010
120views more  TIFS 2010»
13 years 2 months ago
Quantitative Structural Steganalysis of Jsteg
Quantitative steganalysis strives to estimate the change rate defined as the relative number of embedding changes introduced by steganography. In this paper, we propose two new cla...
Jan Kodovský, Jessica J. Fridrich
APAL
2010
85views more  APAL 2010»
13 years 7 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