The following pages link to Francesco Mario Malvestuto (Q1271614):
Displayed 35 items.
- Item:Q1271614 (redirect page) (← links)
- A complete axiomatization of full acyclic join dependencies (Q293431) (← links)
- Item:Q1271614 (redirect page) (← links)
- Equivalence between hypergraph convexities (Q410668) (← links)
- Computing the maximum-entropy extension of given discrete probability distributions (Q804113) (← links)
- A universal table model for categorical databases (Q918682) (← links)
- Canonical and monophonic convexities in hypergraphs (Q1043946) (← links)
- Theory of random observables in relational data bases (Q1054486) (← links)
- Existence of extensions and product extensions for discrete probability distributions (Q1098477) (← links)
- A unique formal system for binary decompositions of database relations, probability distributions, and graphs (Q1177386) (← links)
- Comment on ''A unique formal system for binary decompositions of database relations, probability distributions, and graphs (Q1193819) (← links)
- A fast algorithm for query optimization in universal-relation databases (Q1271615) (← links)
- Decomposition of a hypergraph by partial-edge separators (Q1566705) (← links)
- From conditional independences to factorization constraints with discrete random variables (Q1601910) (← links)
- An implementation of the iterative proportional fitting procedure by propagation trees. (Q1606471) (← links)
- Statistical treatment of the information content of a database (Q1822529) (← links)
- Computing simple-path convex hulls in hypergraphs (Q1944079) (← links)
- Decomposable convexities in graphs and hypergraphs (Q1952718) (← links)
- An analytical approach to the inference of summary data of additive type (Q2456376) (← links)
- Minimal invariant sets in a vertex-weighted graph (Q2508971) (← links)
- Decomposability of abstract and path-induced convexities in hypergraphs (Q2516676) (← links)
- (Q2925638) (← links)
- Compositional models, Bayesian models and recursive factorization models (Q2956000) (← links)
- (Q3057242) (← links)
- A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph (Q3149876) (← links)
- (Q3355066) (← links)
- Erratum: Equivalence of compositional expressions and independence relations in compositional models (Q3447626) (← links)
- Marginalization in models generated by compositional expressions (Q3466268) (← links)
- (Q4414530) (← links)
- Two classes of graphs in which some problems related to convexity are efficiently solvable (Q4554573) (← links)
- CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT (Q4903647) (← links)
- (Q4915354) (← links)
- (Q4917827) (← links)
- A Join-Like Operator to Combine Data Cubes and Answer Queries from Multiple Data Cubes (Q5012502) (← links)
- A new notion of convexity in digraphs with an application to Bayesian networks (Q5347248) (← links)