• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта
Найдено 89 публикаций
Сортировка:
по названию
по году
Статья
Osipov D. Lecture Notes in Computer Science. 2012. Vol. 7642 LNCS. P. 37-48.
In what follows an upper bound for the probability of erroneous decoding in a coded DHA FH OFDMA system with a noncoherent ML detector under multitone jamming is introduced.
Добавлено: 6 февраля 2013
Статья
Goldengorin B. I., Krushinsky D. Lecture Notes in Computer Science. 2011. Vol. 6701. P. 503-516.
Добавлено: 30 июля 2012
Статья
Poelmans J., Dedene G., Viaene S. et al. Lecture Notes in Computer Science. 2011. Vol. 6828. P. 201-214.
Добавлено: 6 марта 2012
Статья
Fomichov V. A., Кирилов А. С. Lecture Notes in Computer Science. 2012. Vol. 7557 LNAI. P. 296-304.
The paper describes a new method of constructing semantic expansions of search requests about the achievements and failures of active systems (organizations, people) for improving the results of Web search. This method is based on the theory of K-representations (knowledge representations), proposed by V.A. Fomichov - a new theory of designing semantic-syntactic analysers of natural language texts with the broad use of formal means for representing input, intermediary, and output data. The method uses an original formal model of a goals base - a knowledge base containing the information about the goals of active systems. The stated approach is implemented with the help of the Web programming language Java: an experimental search system AOS (Aspect Oriented Search) has been developed and tested.
Добавлено: 6 февраля 2013
Статья
Mirkin B., Fenner T., Nascimento S. et al. Lecture Notes in Computer Science. 2010. Vol. 6076. No. 1. P. 152-161.

Гибрид двух новых методов, спектральной кластеризации и метод таксономии - применяется для анализа научно-исследовательской деятельности кафедры. Приведенн пример, иллюстрирующий этот метод, который применяется для решения реальных задач.

Добавлено: 14 ноября 2012
Статья
Shehtman V. B., Chagrov A. Lecture Notes in Computer Science. 1995. Vol. 933. P. 442-455.
Добавлено: 8 октября 2010
Статья
Vereshchagin N., Shen A. Lecture Notes in Computer Science. 2017. Vol. 10010. P. 669-737.
Добавлено: 13 февраля 2017
Статья
Maxim Babenko, Goldberg A. V., Gupta A. et al. Lecture Notes in Computer Science. 2013. Vol. 7965. No. PART 1. P. 69-80.

Cohen et al. developed an O(log n)-approximation algorithm for minimizing the total hub label size (l1 norm). We give O(log n)- approximation algorithms for the problems of minimizing the maximum label (l∞ norm) and minimizing lp and lq norms simultaneously.

Добавлено: 13 ноября 2013
Статья
Разенштейн И. П., Бабенко М. А., Колесниченко И. И. Lecture Notes in Computer Science. 2010. № 5901. С. 165-175.
Добавлено: 17 декабря 2010
Статья
Semenov V., Sukhoparov M., Лебедев И. С. Lecture Notes in Computer Science. 2018. Vol. 11118 LNCS. P. 289-298.
Добавлено: 23 апреля 2019
Статья
Salakhutdinova K., Krivtsova I., Sukhoparov M. et al. Lecture Notes in Computer Science. 2018. Vol. 11118 LNCS. P. 318-327.

Statement of Research. A need to reduce the increasing number of system vulnerabilities caused by unauthorized software installed on computer aids necessitates development of an approach to automate the data-storage media audit. The article describes an approach to identification of informative assembly instructions. Also, the influence of a chosen feature that is used to create a unified program signature on identification result is shown. Methods. Shannon method allowing a determination of feature informativeness for a random number of object classes and not depending on the sample volume of observed features is used to calculate informativeness. Identification of elf-files was based on applying statistical chi-squared test of homogeneity. Main Findings. Quantitative characteristics of informativeness for 118 assembly instructions have been obtained. The analysis of experimental results for executable files identification with 10 different features used to create program signatures compared by means of the chi-squared test of homogeneity at significance levels p = 0.05 and p = 0.01 has been carried out. Practical Relevance. The importance of using a particular feature in program signature creation has been discovered, as well as the capability of considering several executable file signatures together to provide a summative assessment on their belonging to a certain program.

Добавлено: 23 апреля 2019
Статья
Ignatov D. I., Poelmans J., Dedene G. et al. Lecture Notes in Computer Science. 2012. Vol. 7143 LNCS. P. 195-202.
The topic of recommender systems is rapidly gaining interest in the user-behaviour modeling research domain. Over the years, various recommender algorithms based on different mathematical models have been introduced in the literature. Researchers interested in proposing a new recommender model or modifying an existing algorithm should take into account a variety of key performance indicators, such as execution time, recall and precision. Till date and to the best of our knowledge, no general cross-validation scheme to evaluate the performance of recommender algorithms has been developed. To fill this gap we propose an extension of conventional cross-validation. Besides splitting the initial data into training and test subsets, we also split the attribute description of the dataset into a hidden and visible part. We then discuss how such a splitting scheme can be applied in practice. Empirical validation is performed on traditional user-based and item-based recommender algorithms which were applied to the MovieLens dataset.
Добавлено: 6 февраля 2013
Статья
Nazarenko A., Sukhoroslov O. V. Lecture Notes in Computer Science. 2017. Vol. 10421. P. 327-341.
Добавлено: 30 августа 2018
Статья
Bogdanova-Beglarian N., Sherstinova T., Blinova O. et al. Lecture Notes in Computer Science. 2016. Vol. 9811. P. 100-107.
Добавлено: 31 декабря 2017
Статья
Babenko M. A., Artamonov S. I., Salikhov K. Lecture Notes in Computer Science. 2012. No. 7434. P. 109-120.

A digraph G = (V,E) with a distinguished set T V of terminals is called inner Eulerian if for each v V T the numbers of arcs entering and leaving v are equal. By a T-path we mean a simple directed path connecting distinct terminals with all intermediate nodes in V T. This paper concerns the problem of finding a maximum T-path packing, i.e. a maximum collection of arc-disjoint T-paths. A min-max relation for this problem was established by Lomonosov. The capacitated version was studied by Ibaraki,  Karzanov, and Nagamochi, who came up with a strongly-polynomial algorithm of complexity O(φ(V,E) log T +V 2E) (hereinafter φ(n,m) denotes the complexity of a max-flow computation in a network with n nodes and m arcs). For unit capacities, the latter algorithm takes O(φ(V,E) log T +V E) time, which is unsatisfactory since a max-flow can be found in o(V E) time. For this case, we present an improved method that runs in O(φ(V,E) log T + E log V ) time. Thus plugging in the max-flow algorithm of Dinic, we reduce the overall complexity from O(V E) to O(min(V 2/3E,E3/2) log T).

Добавлено: 27 января 2013
Статья
Savchenko A. Lecture Notes in Computer Science. 2015. Vol. 9124. P. 236-245.
Добавлено: 5 июля 2015
Статья
Mikhail Klimushkin, Sergei Obiedkov, Camille Roth Lecture Notes in Computer Science. 2010. Т. 5986. С. 255-266.
Добавлено: 14 ноября 2012
Статья
Mirkin B. Lecture Notes in Computer Science. 2011. Vol. 6743. P. 248-256.
Добавлено: 1 февраля 2012
Статья
Babin M. A., Kuznetsov S. Lecture Notes in Computer Science. 2012. Vol. 7278 LNAI. P. 7-15.
Concept stability was used in numerous applications for selecting concepts as biclusters of similar objects. However, scalability remains a challenge for computing stability. The best algorithms known so far have algorithmic complexity quadratic in the size of the lattice. In this paper the problem of approximate stability computation is analyzed. An approximate algorithm for computing stability is proposed. Its computational complexity and results of computer experiments in comparing stability index and its approximations are discussed.
Добавлено: 7 февраля 2013
Статья
Savelieva A., Khovratovich D., Rechberger C. Lecture Notes in Computer Science. 2012. Vol. 7549 LNCS. P. 244-263.

We present a new concept of biclique as a tool for preimage attacks, which employs many powerful techniques from differential cryptanalysis of block ciphers and hash functions. The new tool has proved to be widely applicable by inspiring many authors to publish new results of the full versions of AES, KASUMI, IDEA, and Square. In this paper, we show how our concept leads to the first cryptanalysis of the round-reduced Skein hash function, and describe an attack on the SHA-2 hash function with more rounds than before.

Добавлено: 7 февраля 2013
Статья
Nascimento S., Mirkin B. Lecture Notes in Computer Science. 2011. Vol. 6743. P. 273-277.

An additive spectral method for fuzzy clustering is presented. The method operates on a clustering model which is an extension of the spectral decomposition of a square matrix. The computation proceeds by extracting clusters one by one, which allows us to draw several stoppingrules to the procedure. We experimentally test the performance of our method and show its competitiveness.method and show its competitiveness.

Добавлено: 1 февраля 2012