Pages that link to "Item:Q2639033"

The following pages link to Efficient computation of transitive closures (Q2639033):

Displaying 19 items.

• Effective approximation of parametrized closure systems over transactional data streams (Q782465) (← links)
• Computing transitive closure on systolic arrays of fixed size (Q808290) (← links)
• The fuzzy functional dependency on the basis of the semantic distance (Q1315845) (← links)
• Iterates of fuzzy circulant matrices (Q1319440) (← links)
• Fuzzy functional dependencies and Bayesian networks (Q1400037) (← links)
• A fuzzy approach to classification of text documents (Q1412148) (← links)
• Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. (Q1428064) (← links)
• A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices (Q2027889) (← links)
• Efficient transitive closure of sparse matrices over closed semirings (Q2368941) (← links)
• UPGMA clustering revisited: a weight-driven approach to transitive approximation (Q2506948) (← links)
• Calculating exact transitive closure for a normalized affine integer tuple relation (Q2839225) (← links)
• An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations (Q3066149) (← links)
• (Q3348934) (← links)
• Cache-Friendly implementations of transitive closure (Q3507763) (← links)
• (Q4471323) (← links)
• (Q4601904) (← links)
• A faster and simpler fully dynamic transitive closure (Q4962698) (← links)
• The fuzzy association degree in semantic data models (Q5946473) (← links)
• Computations with finite closure systems and implications (Q6064021) (← links)