Results 1 to 10 of about 2,112 (254)
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
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
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
Mathematics, 2023 This study describes a consistency-based approach for multiperson decision-making (MPDM) in which decision-makers’ suggestions are expressed as incomplete interval-valued fuzzy preference relations. The presented approach utilizes Lukasiewicz’s t-norm in
Xiaodong Yu +4 more
doaj +1 more source
Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees [PDF]
Logical Methods in Computer Science, 2012 We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees.
Amélie Gheerbrant, Balder ten Cate
doaj +1 more source
Brick polytopes, lattices and Hopf algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Generalizing the connection between the classes of the sylvester congruence and the binary trees, we show that the classes of the congruence of the weak order on Sn defined as the transitive closure of the rewriting rule UacV1b1 ···VkbkW ≡k UcaV1b1 ...
Vincent Pilaud
doaj +1 more source
ID-based transitive signature schemes without random oracle
Tongxin xuebao, 2010 Based on waters’ signature scheme,the first identity-based transitive signature scheme was proposed and proved secure against attacks in the standard model.Compared with current transitive signature schemes,the unforgeability of the signature’s ...
MA Xiao-long1 +4 more
doaj +2 more sources
Pracì Mìžnarodnogo Geometričnogo Centru, 2015 The paper contains the results which describe the properties of such general topological construction as open extension topology. In particular, we prove that this topology is not transitive. We find the base of the least cardinality for the topology and
Вячеслав Бабич +1 more
doaj +1 more source