Sciweavers

57 search results - page 3 / 12
» Independence and Functional Dependence Relations on Secrets
Sort
View
FTRTFT
1994
Springer
13 years 11 months ago
Specification and Refinement of Finite Dataflow Networks - a Relational Approach
We specify the black box behavior of dataflow components by characterizing the relation between their input and their output histories. We distinguish between three main classes of...
Manfred Broy, Ketil Stølen
JUCS
2007
99views more  JUCS 2007»
13 years 7 months ago
Consensus Determining with Dependencies of Attributes with Interval Values
: In this paper the author considers some problems related to attribute dependencies in consensus determining. These problems concern the dependencies of attributes representing th...
Michal Zgrzywa
JMLR
2002
160views more  JMLR 2002»
13 years 7 months ago
Kernel Independent Component Analysis
We present a class of algorithms for independent component analysis (ICA) which use contrast functions based on canonical correlations in a reproducing kernel Hilbert space. On th...
Francis R. Bach, Michael I. Jordan
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 2 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
EUSFLAT
2003
102views Fuzzy Logic» more  EUSFLAT 2003»
13 years 8 months ago
Transitive comparison of marginal probability distributions
A generalized dice model for the pairwise comparison of non-necessarily independent random variables is established. It is shown how the transitivity of the probabilistic relation...
Hans De Meyer, Bernard De Baets, Bart De Schuymer