algorithm complexity

Numerical Optimization Method for Clustering in Content-Based Image Retrieval Systems

The object of the study is the process of organizing a descriptor repository in content-based image retrieval systems. The subject of the study is a method of numerical optimization of descriptor clustering in a multidimensional space. The aim of this work is to develop a clustering optimization method in the Multidimensional Cube model to improve search efficiency. The core idea is to ensure a more uniform distribution of descriptors across clusters by adjusting interval boundaries in each dimension, which reduces imbalance in cluster density and improves retrieval performance.

Exploration of simple graphs by a collective of agents

The article addresses the problem of exploring simple undirected graphs using a multi-agent system consisting of two agents: an agent-researcher, which can traverse the graph, read and modify the labels of its elements, and exchange information with the second agent – an agent-experimenter, which constructs a map of the explored graph in its memory in the form of edge and node lists.  An algorithm is proposed with quadratic time, space, and communication complexities (with respect to the number of nodes in the graph).  The upper estimate of the number of transitions alo