Results 31 to 40 of about 52,731 (268)
Complex transitive closure queries on a fragmented graph [PDF]
, 1990 In this paper we study the reformulation of transitive closure queries on a fragmented graph. We split a query into several subqueries, each requiring only a fragment of the graph.
Apers, Peter M.G. +2 more
core +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
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
Parameterized Complexity and Approximation Issues for the Colorful Components Problems
, 2018 The quest for colorful components (connected components where each color is associated with at most one vertex) inside a vertex-colored graph has been widely considered in the last ten years.
Dondi, Riccardo, Sikora, Florian
core +2 more sources
The Anatomical Record, EarlyView.Abstract Modularity and integration are key developmental properties and have remained central in evo‐devo research because of how they relate to evolvability. While modularity and integration have commonly been assessed with landmark‐based geometric morphometrics (GMM), other methods such as anatomical network analysis (AnNA) are increasingly being ...
Kevin K. Duclos +4 more
wiley +1 more source
K-causality coincides with stable causality
, 2008 It is proven that K-causality coincides with stable causality, and that in a K-causal spacetime the relation K^+ coincides with the Seifert's relation. As a consequence the causal relation "the spacetime is strongly causal and the closure of the causal ...
Minguzzi, E.
core +2 more sources
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
Chemistry–Methods, EarlyView.Tandem mass spectrum to decision (MS2DECIDE) leverages decision theory and expert knowledge to aggregate the outputs of three widely used annotation tools (GNPS, Sirius, and ISDB‐LOTUS) and compute a recommendation for targeting natural products with regard to their potential novelty.
Yassine Mejri +7 more
wiley +1 more source