Related papers: An efficient algorithm for locating and continuing…
Query workloads and database schemas in OLAP applications are becoming increasingly complex. Moreover, the queries and the schemas have to continually \textit{evolve} to address business requirements. During such repetitive transitions, the…
This paper presents a novel algorithm to incorporate orbital parameters into radar ambiguity function expressions by extending the standard ambiguity function to match Keplerian two-body orbits. A coherent orbital matched-filter will…
Hypergraphs, increasingly utilised for modelling complex and diverse relationships in modern networks, gain much attention representing intricate higher-order interactions. Among various challenges, cohesive subgraph discovery is one of the…
In autonomous differential equations where a single first integral is present, periodic orbits are well-known to belong to one-parameter families, parameterized by the first integral's values. This paper shows that this characteristic…
We propose a distributed positioning algorithm to estimate the unknown positions of a number of target nodes, given distance measurements between target nodes and between target nodes and a number of reference nodes at known positions.…
We present a novel algorithm which can overcome the drawbacks of the conventional linear scaling method with minimal computational overhead. This is achieved by introducing additional constraints, thus eliminating the redundancy of the…
Graphlet analysis is an approach to network analysis that is particularly popular in bioinformatics. We show how to set up a system of linear equations that relate the orbit counts and can be used in an algorithm that is significantly…
We present a new method for locating unstable periodic points of one dimensional chaotic maps. This method is based on order statistics. The densities of various maxima of the iterates are discontinuous exactly at unstable periodic points…
This thesis explores the benefits machine learning algorithms can bring to online planning and scheduling for autonomous vehicles in off-road situations. Mainly, we focus on typical problems of interest which include computing itineraries…
The quest for efficient sorting is ongoing, and we will explore a graph-based stable sorting strategy, in particular employing comparison graphs. We use the topological sort to map the comparison graph to a linear domain, and we can…
We consider the solution of initial value problems within the context of hybrid systems and emphasise the use of high precision approximations (in software for exact real arithmetic). We propose a novel algorithm for the computation of…
This paper explores a novel approach aimed at overcoming existing challenges in the realm of local search algorithms. Our aim is to improve the decision process that takes place within a local search algorithm so as to make the best…
In [1], we have presented the theoretical background for finding the Elementary Invariants for a 3D system of first order rational differential equations (1ODEs). We have also provided an algorithm to find such Invariants. Here we introduce…
We consider the problem of classifying a map using a team of communicating robots. It is assumed that all robots have localized visual sensing capabilities and can exchange their information with neighboring robots. Using a graph…
We present a topological method of obtaining the existence of infinite number of symmetric periodic orbits for systems with reversing symmetry. The method is based on covering relations. We apply the method to a four-dimensional reversible…
In the last decade the broad scope of complex networks has led to a rapid progress. In this area a particular interest has the study of community structures. The analysis of this type of structure requires the formalization of the intuitive…
In this paper, we use composite optimization algorithms to solve sigmoid networks. We equivalently transfer the sigmoid networks to a convex composite optimization and propose the composite optimization algorithms based on the linearized…
This paper proposes an efficient hybrid localization framework for the autonomous navigation of an unmanned ground vehicle in uneven or rough terrain, as well as techniques for detailed processing of 3D point cloud data. The framework is an…
In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this…
Many practitioners in robotics regularly depend on classic, hand-designed algorithms. Often the performance of these algorithms is tuned across a dataset of annotated examples which represent typical deployment conditions. Automatic tuning…