10,554 Hits in 5.7 sec

A linear-time parameterized algorithm for computing the width of a DAG [article]

Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2021 arXiv   pre-print
The fact that the width can be computed by a single f(k)-sweep of the DAG is a new surprising insight into this classical problem.  ...  Since k can be small in practical applications, research has also studied algorithms whose complexity is parameterized on k.  ...  Furthermore, there exist fixed-parameter tractable (FPT) algorithms for several problems on DAGs, which are parameterized by the width of the DAG (see examples in scheduling [26, 8] and computational  ... 
arXiv:2007.07575v3 fatcat:a2heul76azawbhoz26jwcbl44a

Efficient Algorithms and Performance Results for Multi-User Knowledge Bases

Vinay K. Chaudhri, John Mylopoulos
1995 International Joint Conference on Artificial Intelligence  
The paper describes research efforts to develop efficient implementation techniques for large, shared knowledge bases, focusing on efficient concurrent access of large knowledge bases by multiple users  ...  We present an algorithm, called the Dynamic Directed Graph policy, originally proposed in [Chaudhri et a/., 1992], which al lows efficient interleaved execution of transac tions against a large knowledge  ...  The check can be made more efficient by observing that if U3 is not satisfied for a node A, it is also not satisfied for descendants of A, Class 2 and therefore, the paths passing through them need not  ... 
dblp:conf/ijcai/ChaudhriM95 fatcat:oltorx556zfmbepabqcghxxb6a

Efficient Realization of Householder Transform Through Algorithm-Architecture Co-Design for Acceleration of QR Factorization

Farhad Merchant, Tarun Vatwani, Anupam Chattopadhyay, Soumyendu Raha, S. K. Nandy, Ranjani Narayan
2018 IEEE Transactions on Parallel and Distributed Systems  
For custom realization of HT and MHT based QR factorization, we also identify macro operations in the DAGs of HT and MHT that are realized on a Reconfigurable Data-path (RDP).  ...  We present efficient realization of Householder Transform (HT) based QR factorization through algorithm-architecture co-design where we achieve performance improvement of 3-90x in-terms of Gflops/watt  ...  Application 2: Eigenvalue Computation Algorithm 1 QR Algorithm 1: Let A (0) = A 2: for K do = 1,2,3... 3: Obtain the factors Q (k) R (k) = A (k−1) 4: Let A (k) = R (k) Q (k) 5: end for Computation  ... 
doi:10.1109/tpds.2018.2803820 fatcat:axzkxm5q7nc6jfr6rnz7hrupee

Efficient and Optimal Algorithms for Tree Summarization with Weighted Terminologies [article]

Xuliang Zhu, Xin Huang, Byron Choi, Jianliang Xu, William K. Cheung, Yanchun Zhang, Jiming Liu
2021 arXiv   pre-print
Extensive experimental results on real-world datasets show the effectiveness and efficiency of our proposed approximate and exact algorithms for tree data summarization.  ...  We propose an efficient greedy algorithm to solve the problem with (1-1/e) = 62% -approximation guarantee.  ...  [9] studies a NP-hard problem of top-k graph summarization on DAGs, which is a generalization of our tree summarization problem.  ... 
arXiv:2008.03053v2 fatcat:tlbfi2lfr5ewrfg7jbkyf5i3ou

Finding a minimum weight K-link path in graphs with Monge property and applications

Alok Aggarwal, Baruch Schieber, Takashi Tokuyama
1993 Proceedings of the ninth annual symposium on Computational geometry - SCG '93  
We give an efficient algorithm for finding the minimum weight K-link path between a given pair of vertices for any given K.  ...  The time complexity of our algorithm is O(n~=) for the concave case and O (ncr (n) log3 n) for the convex case.  ...  Acknowledgement The authors thank James K. Park for communicating the application to quantization.  ... 
doi:10.1145/160985.161135 dblp:conf/compgeom/AggarwalST93 fatcat:ynu5rxrljjddjlkfeh7eqpbite

Top K Query for QoS-Aware Automatic Service Composition

Wei Jiang, Songlin Hu, Zhiyong Liu
2014 IEEE Transactions on Services Computing  
Moreover, we generalize a new graph problem: top k DAGs (Directed Acyclic Graphs) problem based on the above work.  ...  Applications of this new graph problem contain API recommender, supply chain and so on. KPL algorithm illustrated in this paper can address them efficiently too.  ...  It is called "top k DAG problem" for short.  ... 
doi:10.1109/tsc.2013.41 fatcat:cclp7l7emjeyhkxtj43dem5bae

Efficient Algorithms with Asymmetric Read and Write Costs

Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun, Marc Herbstritt
2016 European Symposium on Algorithms  
However, we show that for the minimum edit distance problem (and related problems), which would seem to be a diamond DAG, we can beat this lower bound with an algorithm with only O(ωn 2 /(M min(ω 1/3 ,  ...  Finally, we show several interesting upper bounds for shortest path problems, minimum spanning trees, and other problems.  ...  The DAG computation problem can be modeled as a pebbling game on the DAG [28] .  ... 
doi:10.4230/lipics.esa.2016.14 dblp:conf/esa/BlellochFG0S16 fatcat:36y3lu6itrdsfdpkyy7pskroye

An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs [article]

Andrzej Lingas, Mia Persson, Dzmitry Sledneu
2021 arXiv   pre-print
Our main result is an output-sensitive algorithm for the all-pairs shortest paths problem (APSP) in DAGs with positive and negative real edge weights.  ...  A straightforward dynamic programming method for the single-source shortest paths problem (SSSP) in an edge-weighted directed acyclic graph (DAG) processes the vertices in a topologically sorted order.  ...  For these reasons, efficient algorithms for shortest paths in DAGs are of not only theoretical interest.  ... 
arXiv:2108.03455v1 fatcat:okjezi5bqfd7tify4gwxaycxvm

Growing DAGs: Optimization Functions for Pathway Reconstruction Algorithms [article]

Tunç Başar Köse, Jiarong Li, Anna Ritz
2022 bioRxiv   pre-print
We formulate a new pathway reconstruction problem, one that iteratively grows directed acyclic graphs (DAGs) from a set of starting proteins in a protein interaction network.  ...  We present an algorithm that provably returns the optimal DAGs for two different cost functions, and show how the pathway reconstructions have different topological features for each cost function when  ...  We thank Layla Oesper, Ibrahim Youssef, and Tobias Rubel for feedback on early versions of this manuscript.  ... 
doi:10.1101/2022.07.27.501737 fatcat:uohlxk2qb5hybkuauz6xyxlcem

Lowest common ancestors in trees and directed acyclic graphs

Michael A. Bender, Martín Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin
2005 Journal of Algorithms  
The ideas presented are not novel theoretical contributions, but they lay the foundation for our work on LCA problems in DAGs.  ...  Our results reveal a close relationship between the LCA, all-pairs-shortest-path, and transitive-closure problems.  ...  We develop algorithms for efficiently answering lowest-common-ancestor queries in DAGs.  ... 
doi:10.1016/j.jalgor.2005.08.001 fatcat:bjasqhglyzds3ld46n7hbup2by

On efficient Viterbi decoding for hidden semi-Markov models

Ritendra Datta, Jianying Hu, Bonnie Ray
2008 Pattern Recognition (ICPR), Proceedings of the International Conference on  
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models.  ...  By carefully constructing directed acyclic graphs, we pose the decoding problem as that of finding the longest path between specific pairs of nodes.  ...  of the Viterbi decoding of sequences for HsMM by formulating equivalent DAG longest path problems.  ... 
doi:10.1109/icpr.2008.4761926 dblp:conf/icpr/DattaHR08 fatcat:2eoxgymainabtdfnu5kz6wiayq

Efficient Permutation Discovery in Causal DAGs [article]

Chandler Squires, Joshua Amaniampong, Caroline Uhler
2020 arXiv   pre-print
Building on the minimum degree algorithm for sparse Cholesky decomposition, but utilizing DAG-specific problem structure, we introduce an efficient algorithm for finding such sparse permutations.  ...  We compare our method with w = 1 to algorithms for finding sparse elimination orderings of undirected graphs, and show that taking advantage of DAG-specific problem structure leads to a significant improvement  ...  Acknowledgments Chandler Squires was partially supported by an NSF Graduate Fellowship, MIT J-Clinic for Machine Learning and Health, and IBM.  ... 
arXiv:2011.03610v1 fatcat:bnhbaclxrza2vidqbcijcvas6u

A nonenumerative algorithm to find the k longest (shortest) paths in a DAG [article]

Fatih Kocan
2013 arXiv   pre-print
The algorithm does not enumerate paths therefore it is especially useful for very large k values.  ...  In this paper, we present a novel and efficient algorithm to find the k longest (shortest) paths between sources and sinks in a directed acyclic graph (DAG).  ...  Conclusion In this paper we introduced a novel algorithm based on VSOP and ZBDD to extract the k longest (shortest) paths and the k − th longest (shortest) path from a DAG.  ... 
arXiv:1301.0181v1 fatcat:erbeejgewvbqhaze6jxutfk65y

Distributed data mining in grid computing environments

Ping Luo, Kevin Lü, Zhongzhi Shi, Qing He
2007 Future generations computer systems  
Scheduling, on a two-level Grid architecture (InterGrid, IntraGrid).  ...  Currently a DM IntraGrid, named DMGCE (Data Mining Grid Computing Environment), has been developed with a dynamic scheduling framework for competitive DAGs in a heterogeneous computing environment.  ...  If we feed the datasets to the uppermost node in Algorithm 1 1 Scheduling for the Whole DAG of DDM 1: partition the k-entry DAG into k sub-DAGs 2: send the k sub-DAGs to the nearest external scheduler  ... 
doi:10.1016/j.future.2006.04.010 fatcat:imtvcq3usjcelhovyzhbke6lbi

Finding a minimum-weightk-link path in graphs with the concave Monge property and applications

A. Aggarwal, B. Schieber, T. Tokuyama
1994 Discrete & Computational Geometry  
We apply our algorithm to get efficient solutions for the following problems, improving on previous results: (1) Finding the largest k-gon contained in a given convex polygon. (2) Finding the smallest  ...  We give an efficient algorithm for finding the minimum-weight k-link path between a given pair of vertices for any given k. The time complexity of our algorithm is O(nx/k log n + n log n).  ...  Acknowledgments The authors thank James K. Park for communicating the application to quantization. Also, they thank anonymous referees for many valuable comments; especially,  ... 
doi:10.1007/bf02574380 fatcat:jcucdxzzgfezxalwrznxjky4mm
« Previous Showing results 1 — 15 out of 10,554 results