?
2019 Data Compression Conference Proceedings
IEEE, 2019.
Chapters
Makhalova T., Kuznetsov S., Napoli A., , in: 2019 Data Compression Conference Proceedings.: IEEE, 2019. P. 112–121.
Pattern Mining (PM) has a prominent place in Data Science and finds its application in a wide range of domains. To avoid the exponential explosion of patterns different methods have been proposed. They are based on assumptions on interestingness and usually return very different pattern sets. In this paper, we propose to use a compression-based ...
Added: July 2, 2019
Keywords: data compression
Teregulov T., Loubenets E. R., / Series Quantum Physics "arXiv". 2026. No. 2609.31472.
We develop a new three-party quantum secret-sharing (QSS) protocol based on a three-qubit W state. This protocol encodes the secret-sequence bits using X gates and employs randomly selected Hadamard operations and measurement bases to generate information and security-test rounds. We evaluate the efficiency of the proposed protocol and analyze its security against an internal adversary ...
Added: September 28, 2026
Shabanov N., Kuricheva O., Kurbatova J. et al., / Series Working Papers SSRN "Department of Economics Ca’ Foscari University of Venice". 2026.
The carbon balance of an ecosystem is the difference between Gross Primary Productivity (GPP) and Ecosystem Respiration (Reco) as expressed by Net Ecosystem Exchange (NEE). While remote sensing retrievals of GPP have reached maturity, Reco estimation remains underexplored and ultimately cast bias on NEE. Here we present an end-to-end multi-scale analysis of the mechanism of ...
Added: August 21, 2026
Ponomarenko A., / Series Computer Science "arxiv.org". 2025.
This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection ...
Added: July 30, 2026
Piontkovski D., / Series arXiv "math". 2026.
A noncommutative projective variety is defined, following Artin and Zhang, by a graded coherent algebra 𝐴. The category of coherent sheaves is then the quotient qgr(𝐴) of the category of finitely presented graded modules by the subcategory of torsion modules. We consider the categorical and polynomial entropies of the Serre twist, that is, of the ...
Added: June 23, 2026
Piontkovski D., / Series arXiv "math". 2025.
If a symmetric multilinear algebra is weakly nil, then it is Engel. This result may be regarded as an infinite-dimensional analogue of the well-known Jacobian theorem, which states that if a polynomial mapping has a polynomial inverse, then its Jacobian matrix is invertible. This refines a theorem of Gerstenhaber and partially answers a question posed ...
Added: June 23, 2026
Shipilov F., Barnyakov A., Ivanov A. et al., / Series Physics "arxiv.org". 2026.
A fast simulation of the detector response is a vital task in high-energy physics (HEP). Traditional Monte-Carlo methods form the backbone of modern particle physics simulation software but are computationally expensive. We present a machine-learning-based approach to fast simulation of the Focusing Aerogel Ring Imaging Cherenkov (FARICH) detector response. Given a particle track and momentum, ...
Added: May 19, 2026
Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.
Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...
Added: April 28, 2026
Pilé I., Deng Y., Shchur L., / Series arXiv "math". 2026. No. 2604.10254.
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Svendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for two models in different universality classes: the Ising model and the Potts model with three components. The overlap of two ...
Added: April 20, 2026
Gabdullin N., Androsov I., / Series Computer Science "arxiv.org". 2026.
Label prediction in neural networks (NNs) has O(n) complexity proportional to the number of classes. This holds true for classification using fully connected layers and cosine similarity with some set of class prototypes. In this paper we show that if NN latent space (LS) geometry is known and possesses specific properties, label prediction complexity can ...
Added: April 2, 2026
Sorokin K., Beketov M., Онучин А. et al., / arxiv.org. Серия cs.SI "Social and Information Networks ". 2025.
Community detection in complex networks is a fundamental problem, open to new approaches in various scientific settings. We introduce a novel community detection method, based on Ricci flow on graphs. Our technique iteratively updates edge weights (their metric lengths) according to their (combinatorial) Foster version of Ricci curvature computed from effective resistance distance between the ...
Added: January 15, 2026
Petrovanov I., Sergeev A., / Series Computer Science "arxiv.org". 2025. No. 2512.18332.
Transport coding reduces message delay in packet-switched networks by introducing controlled redundancy at the transport layer: original packets are encoded into coded packets, and the message is reconstructed after the first successful deliveries, effectively shifting latency from the maximum packet delay to the -th order statistic. We present a concise, reproducible discrete-event implementation of transport coding in OMNeT++, including ...
Added: December 24, 2025
Alexander Karnaukhov, Artem Idelevich, Alexey Rolich et al., , in: 2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY).: IEEE, 2023. P. 189–193.
Data transmission over low-speed networks is a subject of global research interest, with a specific focus on overcoming limitations in satellite communication channels. However, little research has addressed the impact of compression on data transmission efficiency in heterogeneous networks using satellite links, especially in the context of the Internet of Remote Things and under poor ...
Added: November 4, 2023
Polyakov I. V., Chepovskiy A., Chepovskiy A., Journal of Mathematical Sciences 2020 Vol. 245 P. 197–201
In this paper we propose an approach for compact storage of big graphs. We
propose the preprocessing algorithms of a certain type of graphs which can
signi cantly increase the data density on the disc and increase performance
of fundamental operations with graphs. ...
Added: January 30, 2020
Казаков А. Я., Zhikhareva A., Пасечник П. А., Информационные технологии и вычислительные системы 2018 № 3 С. 59–68
Problems of data compression are under consideration. Different modifications of the Byte Pair Encoding
(BPE) algorithm are discussed. A comparative analysis of the obtained results is made from the point of
view of the set of factors — the compression ratio of data and the time spent on the coding. ...
Added: May 3, 2019
Polyakov I. V., Chepovskiy A., Chepovskiy A., Фундаментальная и прикладная математика 2016 Т. 21 № 4 С. 125–132
В статье рассматриваются методы сжатия данных для хранения графов больших размеров. Предлагаются алгоритмы препроцессинга графа специальной структуры для повышения плотности записи данных и повышения эффективности выполнения базовых операций с графами. ...
Added: December 23, 2017
Polyakov I. V., Chepovskiy A., В кн.: Труды Международной научной конференции Московского физико-технического института (государственного университета) и Института физико-технической информатики (SCVRT1516).: М., Протвино: Институт физико-технической информатики, 2016. С. 76–78.
In this paper we propose an approach for compact storaging of a certain type of graphs. We use preprocessing algorithms which can significantly increase the data density on the disc and reduce the required number of disk accesses required to perform fundamental operations with the graph. ...
Added: November 20, 2016
Avdoshin S. M., Набебин А. А., М.: ДМК Пресс, 2017.
The textbook contains necessary information about universal and classical algebras, systems of axioms for the basic algebraic structures (groupoid, monoid, semi-groups, groups, partial orders, rings, fields). The basic cryptographic algorithms are described. Error-correcting codes - linear, cyclic, BCH are considered. Algorithms for designing of such codes are given. Many examples are shown. It is put ...
Added: August 19, 2016
Maslov V. P., Nazaikinskii V. E., Mathematical notes 2016 Vol. 99 No. 3 P. 616–618
Added: July 7, 2016
Proceedings of the First International Conference on Data Compression, Communications and Processing
NY: IEEE Computer Society, 2013.
This book constitutes the refereed proceedings of the First International Conference on Data Compression, Communications and Processing held in Palinuro, Italy, in June 2011. ...
Added: October 30, 2013