Search
Search Results
-
2k-Vertex Kernels for Cluster Deletion and Strong Triadic Closure
Cluster deletion and strong triadic closure are two important NP-complete problems that have received significant attention due to their applications...
-
Link prediction in directed complex networks: combining similarity-popularity and path patterns mining
Discovering new relationships between entities in networked data is essential in various applications such as sociology, security, physics, and...
-
Weighted Path Orders Are Semantic Path Orders
We explore the relationship between weighted path orders and (monotonic) semantic path orders. Our findings reveal that weighted path orders can be...
-
Extending Defeasible Reasoning Beyond Rational Closure
The KLM framework is a well known extension of classical logic for incorporating defeasible reasoning. Central to the KLM framework is rational...
-
Efficient Regular Path Query Evaluation with Structural Path Constraints
Regular path query is a technique of using a regular expression (regex) on graph data. Classical methods adopt the finite state automaton to match...
-
Cyclic Hypersequent System for Transitive Closure Logic
We propose a cut-free cyclic system for transitive closure logic (TCL) based on a form of hypersequents , suitable for automated reasoning via proof...
-
Constraint-free discretized manifold-based path planner
Autonomous robotic path planning in partially known environments, such as warehouse robotics, deals with static and dynamic constraints. Static...
-
Incremental Transitive Closure for Zonal Abstract Domain
The Zonal numerical domain is an efficient, weakly-relational abstract domain in static analysis by abstract interpretation. Compared to the Interval...
-
Closure and Decision Properties for Higher-Dimensional Automata
In this paper we develop the language theory of higher-dimensional automata (HDAs). Regular languages of HDAs are sets of finite interval partially...
-
Loop Closure Detection Based on Local and Global Descriptors with Sinkhorn Algorithm
This paper presents a novel loop closure detection pipeline for SLAM systems, addressing the limitations of current deep learning methods in...
-
Loop Closure Detection in Visual SLAM Based on Convolutional Neural Network
In Robotics, autonomous navigation has been addressed in recent years due to the potential of applications in different areas, such as industrial,...
-
Answering Property Path Queries over Federated RDF Systems
Property path query can get graph nodes meeting complex conditions with more concise expressions for some SPARQL basic graph patterns, which is an...
-
A distributed variable density path search and simplification method for industrial manipulators with end-effector’s attitude constraints
In many robot operation scenarios, the end-effector’s attitude constraints of movement are indispensable for the task process, such as robotic...
-
Characterizations and Directed Path-Width of Sequence Digraphs
Computing the directed path-width of a directed graph is an NP-hard problem. Even for digraphs of maximum semi-degree 3 the problem remains hard. We...
-
A state-of-the-art review on topology and differential geometry-based robotic path planning—part I: planning under static constraints
Autonomous robotics has permeated several industrial, research and consumer robotic applications, of which path planning is an important component....
-
FPIRPQ: Accelerating regular path queries on knowledge graphs
With the growing popularity and application of knowledge-based artificial intelligence, the scale of knowledge graph data is dramatically increasing....
-
Lagrangian Trajectories and Closure Models in Mixed Quantum-Classical Dynamics
Mixed quantum-classical models have been proposed in several contexts to overcome the computational challenges of fully quantum approaches. However,...
-
Join Ordering of SPARQL Property Path Queries
SPARQL property path queries provide a succinct way to write complex navigational queries over RDF knowledge graphs. However, their evaluation...
-
Bitwise Algorithms to Compute the Transitive Closure of Graphs in Python
The transitive closure (TC) of a graph is a core problem in graph analytics. There exist many High Performance Computing (HPC) and database solutions...
-
Ideal hierarchical secret sharing and lattice path matroids
By a fundamental result by Brickell and Davenport (J Cryptol 4:123–134, 1991), the access structures of ideal secret sharing schemes are matroid...
