Related references
Note: Only part of the references are listed.Noncoherent space-time coding for correlated massive MIMO channel with Riemannian distance
Shuangzhi Li et al.
DIGITAL SIGNAL PROCESSING (2023)
AI-Empowered Speed Extraction via Port-Like Videos for Vehicular Trajectory Analysis
Xinqiang Chen et al.
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS (2023)
Mining truck platooning patterns through massive trajectory data
Xiaolei Ma et al.
KNOWLEDGE-BASED SYSTEMS (2021)
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks
Ye Wang et al.
SIGMOD '21: PROCEEDINGS OF THE 2021 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA (2021)
DIS-C: conceptual distance in ontologies, a graph-based approach
Rolando Quintero et al.
KNOWLEDGE AND INFORMATION SYSTEMS (2019)
Navigating a Shortest Path with High Probability in Massive Complex Networks
Jun Liu et al.
ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019 (2019)
FASTER ALL-PAIRS SHORTEST PATHS VIA CIRCUIT COMPLEXITY
R. Ryan Williams
SIAM JOURNAL ON COMPUTING (2018)
Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems
Venkatesan T. Chakaravarthy et al.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2017)
Wikipedia-based information content and semantic similarity computation
Yuncheng Jiang et al.
INFORMATION PROCESSING & MANAGEMENT (2017)
A survey of the all-pairs shortest paths problem and its variants in graphs
K. R. Udaya Kumar Reddy
ACTA UNIVERSITATIS SAPIENTIAE INFORMATICA (2016)
SimLex-999: Evaluating Semantic Models With (Genuine) Similarity Estimation
Felix Hill et al.
COMPUTATIONAL LINGUISTICS (2015)
A Word Net-based semantic similarity measurement combining edge-counting and information content theory
Jian-Bo Gao et al.
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2015)
Feature-based approaches to semantic similarity assessment of concepts using Wikipedia
Yuncheng Jiang et al.
INFORMATION PROCESSING & MANAGEMENT (2015)
SimLex-999: Evaluating Semantic Models With (Genuine) Similarity Estimation
Felix Hill et al.
COMPUTATIONAL LINGUISTICS (2015)
Ontology-based semantic similarity: A new feature-based approach
David Sanchez et al.
EXPERT SYSTEMS WITH APPLICATIONS (2012)
Approximate shortest paths in weighted graphs
Raphael Yuster
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2012)
Ontology-based information content computation
David Sanchez et al.
KNOWLEDGE-BASED SYSTEMS (2011)
MORE ALGORITHMS FOR ALL-PAIRS SHORTEST PATHS IN WEIGHTED GRAPHS
Timothy M. Chan
SIAM JOURNAL ON COMPUTING (2010)
A semantic similarity metric combining features and intrinsic information content
Giuseppe Pirro
DATA & KNOWLEDGE ENGINEERING (2009)
All-pairs nearly 2-approximate shortest paths in O(n2 polylog n) time
Surender Baswana et al.
THEORETICAL COMPUTER SCIENCE (2009)
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
Nattapat Attiratanasunthron et al.
INFORMATION PROCESSING LETTERS (2008)
All-pairs shortest paths with real weights in O(n3/logn) time
Timothy M. Chan
ALGORITHMICA (2008)
R-Kleene: A high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks
Paolo D'Alberto et al.
ALGORITHMICA (2007)
An O(n3 log log n/log n) time algorithm for the all-pairs shortest path problem
T Takaoka
INFORMATION PROCESSING LETTERS (2005)
Approximate distance oracles
M Thorup et al.
JOURNAL OF THE ACM (2005)
Improved algorithm for all pairs shortest paths
YJ Han
INFORMATION PROCESSING LETTERS (2004)
Reachability and distance queries via 2-hop labels
E Cohen et al.
SIAM JOURNAL ON COMPUTING (2003)
All Pairs Shortest Paths using bridging sets and rectangular matrix multiplication
U Zwick
JOURNAL OF THE ACM (2002)
Share Paper
