?
Организация быстрого поиска без индекса
С. 194–200.
In book
Н. Новгород: ИППИ РАН, 2014.
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
Ledneva T., Kovalev A., Procedia Computer Science 2021 Vol. 192 P. 2720–2730
Interaction with digital text permeates practically all types of educational, professional and leisure activities of modern life. The effective working with digital instructions and materials determines the success in solving a number of real problems. At the same time, the negative impact of overly complex digital environments on learning outcomes, work efficiency, and subjective well-being ...
Added: April 27, 2023
Bychkov A., Pogudin G., ACM Communications in Computer Algebra 2021 Vol. 54 No. 3 P. 119–123
Transformation of a polynomial ODE system to a special quadratic form has been successfully used recently as a preprocessing step for model order reduction methods. However, to the best of our knowledge, there has been no practical algorithm for performing this step automatically with any optimality guarantees.
We present an algorithm that, given a system of ...
Added: October 19, 2021
Fomichev M., Ulyanov M., Информационные технологии 2018 Т. 24 № 11 С. 698–704
Повышение временной эффективности программных реализаций метода ветвей и границ для асимметричной задачи коммивояжера может быть достигнуто как за счет выбора наиболее приемлемой структуры данных, обеспечивающей эффективные по времени операции с листьями поискового дерева решений, так и за счет использования дополнительной памяти для хранения усеченных матриц в листьях поискового дерева решений. Дополнительно могут быть предложены и ...
Added: January 26, 2020
Association for Computing Machinery (ACM), 2018.
Added: December 27, 2019
Галимуллин М. Ф., Kalishenko E., Рапоткин Н. А., Известия Санкт-Петербургского государственного электротехнического университета ЛЭТИ 2016 № 7 С. 13–23
Deals with the development of threads synchronizing strategies based on the creation of concurrent «flat-combining» data structures as well as research of their performance. The paper considers «flat-combining» approach and its implementation in the library libcds, the development of thread synchronization strategy and its possible implementations. The efficiency of synchronization strategies usage is researched on ...
Added: November 1, 2018
Babkina T. S., Demidovskij A., Babkin E., International Journal of Big Data Intelligence 2018 Vol. 5 No. 3 P. 143–155
This paper presents two new approaches to solving a classical NP-hard problem of maximum clique problem (MCP), which frequently arises in the domain of information management, including design of database structures and big data processing. In our research, we are focusing on solving that problem using the paradigm of artificial neural networks. The first approach ...
Added: October 3, 2018
Денис Турдаков, Астраханцев Н. А., Недумов Я. Р. et al., Труды Института системного программирования РАН 2014 Т. 26 С. 421–438
he paper presents a framework for fast text analytics developed during the Texterra project. Texterra is a technology for multilingual text mining based on novel text processing methods that exploit knowledge extracted from user-generated content. It delivers a fast scalable solution for text mining without the expensive customization. Depending on use-cases Texterra could be utilized ...
Added: November 6, 2017
Ponomarenko A., Irina Utkina, Mikhail Batsyn, , in: Computational Aspects and Applications in Large-Scale Networks. Springer Proceedings in Mathematics & StatisticsVol. 247.: Springer, 2018. P. 197–203.
One of the approaches for the nearest neighbor search problem is to build a network which nodes correspond to the given set of indexed objects. In this case the search of the closest object can be thought as a search of a node in a network. A procedure in a network is called decentralized if ...
Added: October 18, 2017
Braslavski P., Markov I., Pardalos P. M. et al., ACM SIGIR Forum 2016 Vol. 49 No. 2 P. 72–79
This paper provides the reader with a report on 9th Russian Summer School in Information Retrieval (RuSSIR 2015). ...
Added: February 27, 2017
Kotov A., Treshcheva E., Bessonov L. et al., SIGIR Forum (ACM Special Interest Group on Information Retrieval) 2016 Vol. 50 No. 2 P. 28–35
This paper provides the reader with a report on 10th Russian Summer School in Information Retrieval (RuSSIR 2016). ...
Added: February 27, 2017
Fenogenova A., Kuzmenko E., / NRU HSE. Series WP BRP "Linguistics". 2016.
Learner corpora constitute an effective resource for specialists in fields of second language acquisition, foreign language teaching and corpus linguistics. They tend to get significant scholarly help from statistical tools of various kinds. However, for valuable usage of a corpus it should provide convenient and powerful tools for searching and manipulating data. In this paper ...
Added: December 14, 2016
Ulyanov M.V., Fomichev M.I., Business Informatics 2015 No. 4 (34) P. 38–46
The resource efficiency of different implementations of the branch-and-bound method for the classical traveling salesman problem depends, inter alia, on ways to organize a search decision tree generated by this method. The classic «time-memory» dilemma is realized herein either by an option of storing reduced matrices at the points of the decision tree, which leads ...
Added: November 5, 2016
Ponomarenko A., Avrelin N., Найдан Б. С. et al., Алгоритмы, методы и системы обработки данных 2015 Т. 4 № 33 С. 91–106
Поиск по похожести широко применяется в различных областях компьютерных наук. Множество методов было предложено для решения задачи в точной постановке, однако все они подвержены "проклятью" размерности и не эффективны для данных высокой размерности. Приближенные алгоритмы отчасти позволяют справиться с "проклятьем". Однако из-за сложной стохастической природы, теоретические оценки для большинства приближенных алгоритмов отсутствуют. Более того, на ...
Added: September 27, 2016
Ponomarenko A., Lecture Notes in Computer Science 2015 P. 314–319
The nearest neighbor search problem is well known since 60s. Many approaches have been proposed. One is to build a graph over the set of objects from a given database and use a greedy walk as a basis for a search algorithm. If the greedy walk has an ability to find the nearest neighbor in ...
Added: October 9, 2015
Таганрог: Издательство ЮФУ, 2015.
Сборник составлен по материалам VI Международной научно-практической конференции "Технологии разработки информационных систем", состоявшейся 6-12 сентабря 2015 г. в г. Геленджик.
Ответственность за аутентичность и точность цитат, имен, названий и иных сведений несут авторы публикуемых материалов. Материалы публикуются в авторской редакции.
Мероприятие проведено при финансовой поддержке Российского фонда фундаментальных исследований (грант № 15-07-20559-г). ...
Added: September 13, 2015
Braslavski P., Karpov Nikolay, Worring M. et al., ACM SIGIR Forum 2014 Vol. 48 No. 2 P. 105–110
The 8th Russian Summer School in Information Retrieval (RuSSIR 2014) was held on August 18-22, 2014 in Nizhniy Novgorod, Russia.1 The school was co-organized by the National Research University Higher School of Economics2 and the Russian Information Retrieval Evaluation Seminar (ROMIP) ...
Added: August 22, 2015
Belov A. V., karbachinsky I. O., Качество. Инновации. Образование 2014 № 6 С. 24–32
Today web spam is the one of the key problems of modern web search engines. In this paper we investigate the efficiency of various dimensionality reduction methods applying to the spam classifier of go.mail.ru search system. Effective utilization of such techniques can significantly increase the number of features and the quality of the classifier without ...
Added: February 2, 2015
Babenko A., IEEE Transactions on Pattern Analysis and Machine Intelligence 2014 Vol. PP No. 99 P. 1
A new data structure for efficient similarity search in very large datasets of high-dimensional vectors is introduced. This structure called the inverted multi-index generalizes the inverted index idea by replacing the standard quantization within inverted indices with product quantization. For very similar retrieval complexity and pre-processing time, inverted multi-indices achieve a much denser subdivision of ...
Added: December 19, 2014
Korukhova Y., Мытрова М. В., Открытые системы. СУБД 2013 № 7 С. 57–58
Большинство поисковых систем ищут нотные записи музыкальных произведений по названию и автору композиции, однако исходными данными может служить фрагмент нотной записи либо аудиозапись. В работе рассматривается задача поиска нотных записей по содержимому. ...
Added: November 15, 2014