Results 41 to 50 of about 453,973 (330)
Complements and transitive closures
Discrete Mathematics, 1972 AbstractThe complement of the transitive closure of the complement of a transitive relation is transitive. We prove this fact in three ways, analyze the underlying structure and consider various refinement's and applications.
Graham, R.L., Knuth, D.E., Motzkin, T.S.
openaire +2 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
A transitive closure algorithm [PDF]
BIT Numerical Mathematics, 1970 An algorithm is given for computing the transitive closure of a directed graph in a time no greater thana1N1n+a2n2 for largen wherea1 anda2 are constants depending on the computer used to execute the algorithm,n is the number of nodes in the graph andN1 is the number of arcs (not counting those arcs which are part of a cycle and not counting those arcs
openaire +2 more sources
Computing transitive closures of hedge transformations [PDF]
International Journal of Critical Computer-Based Systems, 2007 We consider the framework of regular hedge model checking where configurations are represented by trees of arbitrary arities, sets of configurations are represented by regular hedge automata, and the dynamic of a system is modelled by a term rewriting system. We consider the problem of computing the transitive closure R*(L) of a hedge automaton L and a
openaire +2 more sources
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
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
SciLitMiner: An Intelligent System for Scientific Literature Mining and Knowledge Discovery
Advanced Intelligent Systems, EarlyView.SciLitMiner is an intelligent system that federately ingests scientific literature, filters it using advanced information retrieval methods, and applies retrieval‐augmented generation tailored to scientific domains. Demonstrated on creep deformation in γ‐TiAl alloys, SciLitMiner provides a controlled workflow for systematic knowledge discovery and ...
Vipul Gupta +3 more
wiley +1 more source
Carbon‐Cutting Chess: Strategizing Resilient Low‐Carbon Investments for Supply Chains
Business Strategy and the Environment, EarlyView.ABSTRACT This research presents a novel empirical and analytical method for strategizing low‐carbon investment strategies (LCIS) in supply chains, viewed through the lens of sustainable and resilient efficiency. The study develops a clear, actionable framework for identifying, evaluating, and implementing LCIS by using a mixed‐methods design.
Ahmed Mohammed
wiley +1 more source
One Edge at a Time: A Novel Approach Towards Efficient Transitive Reduction Computation on DAGs
IEEE Access, 2020 Given a directed acyclic graph (DAG) G, G's transitive reduction (TR) Gtr is the unique DAG satisfying that Gtr has the minimum number of edges and has the same transitive closure (TC) as G.
Xian Tang +5 more
doaj +1 more source
Antifoundation and Transitive Closure in the System of Zermelo
Notre Dame Journal of Formal Logic, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Esser, Olivier, Hinnion, Roland
openaire +2 more sources