Sciweavers

98 search results - page 15 / 20
» Kolmogorov Complexity in Randomness Extraction
Sort
View
IJAR
2006
125views more  IJAR 2006»
13 years 9 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
IS
2010
13 years 8 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
TVCG
2012
169views Hardware» more  TVCG 2012»
12 years 1 days ago
Visual Reasoning about Social Networks Using Centrality Sensitivity
—In this paper, we study the sensitivity of centrality metrics as a key metric of social networks to support visual reasoning. As centrality represents the prestige or importance...
Carlos D. Correa, Tarik Crnovrsanin, Kwan-Liu Ma
CEC
2003
IEEE
14 years 1 months ago
Dynamics of gene expression in an artificial genome
Abstract- Complex systems techniques provide a powerful tool to study the emergent properties of networks of interacting genes. In this study we extract models of genetic regulator...
Kai Willadsen, Janet Wiles
IBPRIA
2003
Springer
14 years 2 months ago
Segmentation of Curvilinear Objects Using a~Watershed-Based Curve Adjacency Graph
Abstract. This paper presents a general framework to segment curvilinear objects in 2D images. A pre-processing step relies on mathematical morphology to obtain a connected line wh...
Thierry Géraud