?
Proceedings of the First International Conference on Data Compression, Communications and Processing
NY :
IEEE Computer Society, 2013.
Academic editor: B. Carpentieri, F. Palmieri
This book constitutes the refereed proceedings of the First International Conference on Data Compression, Communications and Processing held in Palinuro, Italy, in June 2011.
Chapters
Kolpakov R. M., Kucherov G., Starikovskaya T., , in: Proceedings of the First International Conference on Data Compression, Communications and Processing.: NY: IEEE Computer Society, 2013. P. 92–97.
We consider a compact text index based on evenly spaced sparse suffix trees of a text \cite{KU-96}. Such a tree is defined by partitioning the text into blocks of equal size and constructing the suffix tree only for those suffixes that start at block boundaries. We propose a new pattern matching algorithm on this structure. ...
Added: October 30, 2013
Language:
English
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
Dorovskiy A., / Series arXiv "math". 2026.
In this paper the structural stability of generic families of vector fields of the PC-HC class on the two-dimensional sphere is proved. A classification of these families up to moderate equivalence in neighborhoods of their large bifurcation supports is presented, based on such invariants as the configuration and the characteristic set. The realization lemma is proved. ...
Added: May 14, 2026
Taletskii D., / Series arXiv "math". 2026.
A vertex subset of a graph is called a \textit{distance-$k$ independent set} if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal distance-$k$ independent sets among all $n$-vertex trees. It equals~$n$ if $n \leq k ...
Added: May 1, 2026
Ovcharenko M., / Series arXiv "math". 2026.
We introduce an explicit class of tempered Laurent polynomials in the sense of Villegas and Doran--Kerr in n⩽4 variables including all Landau--Ginzburg models for smooth Fano threefolds with very ample anticanonical class. We check that it contains Landau--Ginzburg models for various Fano fourfolds which are complete intersections in smooth toric varieties and Grassmannians of planes, ...
Added: April 30, 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
Zlotnik Alexander, / Series arXiv "math". 2026. No. 2602.03481v1.
We deal with the global in time weak solutions to the 1D compressible Navier-Stokes system of equations for large discontinuous initial data and nonhomogeneous boundary conditions of three standard types. We prove the Lipschitz-type continuous dependence of the solution $(\eta,u,\theta)$, in a norm slightly stronger than $L^{2,\infty}(Q)\times L^2(Q)\times L^2(Q)$, on the initial data $(\eta^0,u^0,e^0)$ in a ...
Added: April 18, 2026
IEEE, 2026.
Preface IEEE Russia North West Section and Saint Petersburg Electrotechnical University “LETI” are pleased to present the Proceedings of the 2026 ElCon Conference of Young Researchers in Computing & Processing, and Information Security (2026 ElCon-CP) held in St. Petersburg, Russia, on February 3-5, 2026. This conference was hosted by Saint Petersburg Electrotechnical University “LETI”. The ...
Added: April 6, 2026
Medvedev V., / Series arXiv "math". 2026.
We investigate the interplay between the dimension of the space of static potentials and the geometric and topological structure of the underlying static three-manifold. A partial classification of boundaryless static manifolds is obtained in terms of this dimension. We also treat the case of static manifolds with boundary. In particular, we prove that if a ...
Added: April 3, 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
Kolesnikov A., / Series arXiv "math". 2025.
We study Blaschke--Santal{ó}-type inequalities for N>=2 sets (functions) and a special class of cost functions. In particular, we prove new results about reduction of the maximization problem for the Blaschke--Santal{ó}-type functional to homogeneous case (functional inequalities on the sphere) and extend the symmetrization argument to the case of N>2 sets.
We also discuss links to the ...
Added: February 13, 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
Vereshchagin N., Дектярев М. В., Математический сборник 2025 Т. 216 № 6 С. 3–45
Полудуплексная коммуникационная сложность с противником определена в работе [Hoover, K., Impagliazzo, R., Mihajlin, I., Smal, A. V. Half-Duplex Communication Complexity, ISAAC 2018.] Полудуплексные коммуникационные протоколы обобщают классические протоколы, определенные Эндрю Яо в [Yao, A. C.-C. Some Complexity Questions Related to Distributive Computing (Preliminary Report), STOC 1979]. До сих пор было неизвестным, различаются ли коммуникационные сложности, определяемые этими моделями. В ...
Added: August 23, 2025
Rodriges Zalipynis R. A., Earth (MDPI) 2024 Vol. 5 No. 3 P. 491–547
Earth data is essential for global environmental studies. Many Earth data types are naturally
modeled by multidimensional arrays (tensors). Array (Tensor) DBMSs strive to be the best systems
for tensor-related workloads and can be especially helpful for Earth data engineering, which takes
up to 80% of Earth data science. We present a new quantum Array (Tensor) DBMS data ...
Added: September 14, 2024
Ignatiev A., Mihajlin I., Smal A., , in: 33rd International Symposium on Algorithms and Computation (ISAAC 2022). LIPIcs, Volume 248.: Saarbrücken, Вадерн: Schloss-Dagstuhl - Leibniz Zentrum für Informatik, 2022. Ch. 66.
Added: November 9, 2023
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
Золотухина М. А., Zykov S. V., Вестник Российского нового университета 2023 № 1 С. 20–28
Зачастую именно человеческий фактор ведет к распространению угроз на предприятиях. Если техническое устройство представляет собой четко работающий и слаженный механизм с возможностью при помощи диагностического оборудования проводить замеры параметров неисправностей и устранять их, то для исследования скрытых атак необходим новый компонент системы. Предприятия и промышленность в целом нуждаются в интеллектуальной системе защиты и обнаружения скрытых ...
Added: April 11, 2023
Кокорина А. В., Slunyaev A., Зайцев А. И. et al., Экологические системы и приборы 2022 № 12 С. 45–54
Long-term measurements of bottom pressure variations obtained in 4 experimental campaigns near Sakhalin Island (Cape Svobodny) are analyzed. The statistical characteristics of 20-minute records of sea surface displacements reconstructed in the hydrostatic approximation, as well as individual wave parameters, such as wave height, period, and wave asymmetry, are studied. Records with similar meteorological conditions are sorted according to ...
Added: January 31, 2023
Soshnikov D. V., Valieva Y., / Series Computer Science "arxiv.org". 2021.
In this paper, we present a new Python library called mPyPl, which is intended to simplify complex data processing tasks using functional approach. This library defines operations on lazy data streams of named dictionaries represented as generators (so-called multi-field datastreams), and allows enriching those data streams with more 'fields' in the process of data preparation ...
Added: October 7, 2021
Vyalyi M., Problems of Information Transmission 2021 Vol. 57 No. 2 P. 143–160
We consider a generalization of the Pólya–Kasteleyn approach to counting the number of perfect matchings in a graph based on computing the symbolic Pfaffian of a directed adjacency matrix of the graph. Complexity of algorithms based on this approach is related to the complexity of the sign function of a perfect matching in generalized decision ...
Added: August 20, 2021
Grexa I., Diosdi A., Harmati M. et al., Scientific Reports 2021 Vol. 11 Article 14813
Recent statistics report that more than 3.7 million new cases of cancer occur in Europe yearly, and the disease accounts for approximately 20% of all deaths. High-throughput screening of cancer cell cultures has dominated the search for novel, effective anticancer therapies in the past decades. Recently, functional assays with patient-derived ex vivo 3D cell culture ...
Added: July 21, 2021
Podolskii V. V., Sherstov A., ACM Transactions on Computation Theory 2020 Vol. 12 No. 4 P. 26
A major goal in complexity theory is to understand the communication complexity of number-on-the-forehead problems f:({0, 1}^n)^k → {0, 1} with k > log n parties. We study the problems of inner product and set disjointness and determine their randomized communication complexity for every k ≥ log n, showing in both cases that Θ(1 + ⌈log n⌉/ log ⌈1 + k/ log n⌉) bits are necessary and ...
Added: December 23, 2020
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