Sciweavers

94 search results - page 11 / 19
» Testing Whether a Set of Code Words Satisfies a Given Set of...
Sort
View
AAAI
2008
13 years 10 months ago
Dormant Independence
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
Ilya Shpitser, Judea Pearl
PODS
2009
ACM
113views Database» more  PODS 2009»
14 years 8 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
PODS
2002
ACM
167views Database» more  PODS 2002»
14 years 8 months ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon
MLQ
2008
63views more  MLQ 2008»
13 years 8 months ago
Generic cuts in models of arithmetic
We present some general results concerning the topological space of cuts of a countable model of arithmetic given by a particular indicator Y . The notion of `indicator' is d...
Richard Kaye
CASCON
1997
93views Education» more  CASCON 1997»
13 years 9 months ago
Repairing software style using graph grammars
Often, software architects impose a particular style on the software systems they design. For large software systems, they would like to ensure that the design continues to confor...
Hoda Fahmy, Richard C. Holt, Spiros Mancoridis