Graphs and algorithms
Semirings, automata, languages
Semirings, automata, languages
Rational series and their languages
Rational series and their languages
Introduction to algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Journal of the ACM (JACM)
A Unified Approach to Path Problems
Journal of the ACM (JACM)
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
Minimization algorithms for sequential transducers
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Finite-state transducers in language and speech processing
Computational Linguistics
The Image Foresting Transform: Theory, Algorithms, and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
Rational Kernels: Theory and Algorithms
The Journal of Machine Learning Research
Trust evaluation in ad-hoc networks
Proceedings of the 3rd ACM workshop on Wireless security
An optimal pre-determinization algorithm for weighted transducers
Theoretical Computer Science - Implementation and application of automata
Generalized algorithms for constructing statistical language models
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
On probabilistic program equivalence and refinement
CONCUR 2005 - Concurrency Theory
Weighted path queries on semistructured databases
Information and Computation
Policy-based routing with non-strict preferences
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Statistical modeling for unit selection in speech synthesis
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Distributed network monitoring and multicommodity flows: a primal-dual approach
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Acoustic Modelling Using Continuous Rational Kernels
Journal of VLSI Signal Processing Systems
Semiring-Based Soft Constraints
Concurrency, Graphs and Models
Proper Noun Recognition and Classification Using Weighted Finite State Transducers
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Randomized shortest-path problems: Two related models
Neural Computation
Lattice Minimum Bayes-Risk decoding for statistical machine translation
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
General indexation of weighted automata: application to spoken utterance retrieval
SpeechIR '04 Proceedings of the Workshop on Interdisciplinary Approaches to Speech Indexing and Retrieval at HLT-NAACL 2004
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Weighted path queries on semistructured databases
Information and Computation
Model Checking for a Class of Weighted Automata
Discrete Event Dynamic Systems
Edit-distance of weighted automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
An efficient pre-determinization algorithm
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
OpenFst: a general and efficient weighted finite-state transducer library
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
A fuzzy approach for negotiating quality of services
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Scalable simulation of complex network routing policies
Proceedings of the 7th ACM international conference on Computing frontiers
A formal study of trust-based routing in wireless ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Unicast and multicast QoS routing with soft-constraint logic programming
ACM Transactions on Computational Logic (TOCL)
The Journal of Machine Learning Research
Comparing canonicalizations of historical German text
SIGMORPHON '10 Proceedings of the 11th Meeting of the ACL Special Interest Group on Computational Morphology and Phonology
fsm2 - a scripting language interpreter for manipulating weighted finite-state automata
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Filters for efficient composition of weighted finite-state transducers
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Lexicographic semirings for exact automata encoding of sequence models
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Estimating the margin of victory for instant-runoff voting
EVT/WOTE'11 Proceedings of the 2011 conference on Electronic voting technology/workshop on trustworthy elections
A general method for assessment of security in complex services
ServiceWave'11 Proceedings of the 4th European conference on Towards a service-based internet
Practical RDF schema reasoning with annotated semantic web data
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
On the computation of some standard distances between probabilistic automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
A unified construction of the glushkov, follow, and antimirov automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Third-order variational reranking on packed-shared dependency forests
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
A process calculus for qos-aware applications
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Efficient computation of the relative entropy of probabilistic automata
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Computing the edit-distance between a regular language and a context-free language
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Computing lattice BLEU oracle scores for machine translation
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
HyTER: meaning-equivalent semantics for translation evaluation
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
Implicitly intersecting weighted automata using dual decomposition
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
Phrase-based approach for adaptive tokenization
SIGMORPHON '12 Proceedings of the Twelfth Meeting of the Special Interest Group on Computational Morphology and Phonology
Information Sciences: an International Journal
Fun with semirings: a functional pearl on the abuse of linear algebra
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Lattice BLEU oracles in machine translation
ACM Transactions on Speech and Language Processing (TSLP)
Solving difference constraints over modular arithmetic
CADE'13 Proceedings of the 24th international conference on Automated Deduction
From model checking to model measuring
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Policy-driven role-based access management for ad-hoc collaboration
Journal of Computer Security
| Hi-index | 0.00 |
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances in a weighted directed graph when the weights satisfy the conditions of our general semiring framework. The same algorithm can be used to solve efficiently classical shortest paths problems or to find the k-shortest distances in a directed graph. It can be used to solve single-source shortest-distance problems in weighted directed acyclic graphs over any semiring. We examine several semirings and describe some specific instances of our generic algorithms to illustrate their use and compare them with existing methods and algorithms. The proof of the soundness of all algorithms is given in detail, including their pseudocode and a full analysis of their running time complexity.