Results 41 to 50 of about 559,747 (351)
On Invoking Transitivity to Enhance the
IEEE Access, 2018 From the earliest studies in graph theory, the phenomenon of transitivity has been used to design and analyze problems that can be mapped onto graphs. Some of the practical examples of this phenomenon are the “Transitive Closure”algorithm ...
Abdolreza Shirvani, B. John Oommen
doaj +1 more source
Algebraic optimization of recursive queries [PDF]
, 1992 Over the past few years, much attention has been paid to deductive databases. They offer a logic-based interface, and allow formulation of complex recursive queries.
Apers, Peter M.G. +2 more
core +5 more sources
Spatiality of Derivations of Operator Algebras in Banach Spaces
Abstract and Applied Analysis, 2011 Suppose that A is a transitive subalgebra of B(X) and its norm closure A¯ contains a nonzero minimal left ideal I. It is shown that if δ is a bounded reflexive transitive derivation from A into B(X), then δ is spatial and implemented uniquely; that is ...
Quanyuan Chen, Xiaochun Fang
doaj +1 more source
Tiling arbitrarily nested loops by means of the transitive
International Journal of Applied Mathematics and Computer Science, 2016 A novel approach to generation of tiled code for arbitrarily nested loops is presented. It is derived via a combination of the polyhedral and iteration space slicing frameworks. Instead of program transformations represented by a set of affine functions,
Bielecki Włodzimierz, Pałkowski Marek
doaj +1 more source
Lattice structure of Grassmann-Tamari orders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 The Tamari order is a central object in algebraic combinatorics and many other areas. Defined as the transitive closure of an associativity law, the Tamari order possesses a surprisingly rich structure: it is a congruence-uniform lattice.
Thomas McConville
doaj +1 more source
The tiered Aubry set for autonomous Lagrangian functions [PDF]
, 2008 If L is a Tonelli Lagrangian defined on the tangent bundle of a compact and connected manifold whose dimension is at least 2, we associate to L the tiered Aubry set and the tiered Mane set (defined in the article).
Arnaud, Marie-Claude
core +3 more sources
The Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution [PDF]
Journal of Information Technology Management, 2019 This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity ...
Yumeng Ye, John Talburt
doaj +1 more source
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda [PDF]
Logical Methods in Computer Science, 2016 Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose.
Jean-Philippe Bernardy, Patrik Jansson
doaj +1 more source
Extending Full Transitive Closure to Rank Removable Edges in GN Algorithm
, 2016 Most of the real-world networks exhibit community structure, a property that reveals the existence of natural vertex clusters whose inter-edge density is lower than intra-edge density between various groups.
R. Gayathri, J. J. Nair, M. D. Kaimal
semanticscholar +1 more source
Existence of acyclic matching and Morse complex on transitive digraphs
AKCE International Journal of Graphs and CombinatoricsFor any digraph, there exists a transitive closure. The transitive digraph is a discrete geometric object which has a close relationship with simplicial complex.
Chong Wang, Shiquan Ren
doaj +1 more source