Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "time complexity" wg kryterium: Wszystkie pola

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-10 z 21
Tytuł:
Time Complexity Reduction of Hard Problems
Autorzy:
Jarosz, Janusz
Jaworski, Jerzy.
Powiązania:
https://bibliotekanauki.pl/articles/748628.pdf
Data publikacji:
1986
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Analysis of algorithms and problem complexity
Opis:
.
The metodology for reduction of the time complexity for a wide class of hard problems is presented. Some open problems connected with the theoretical properties of computer tree (CT) are stated. The most important one consists in the deriving of the algorithms which can be solved in polynomial time using CT.
Źródło:
Mathematica Applicanda; 1986, 14, 28
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The average time complexity of probabilistic algorithms for finding generators in finite cyclic groups
Autorzy:
Adamski, T.
Nowakowski, W.
Powiązania:
https://bibliotekanauki.pl/articles/202161.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
probabilistic algorithm
average time complexity
group generator
cyclic groups
primitive roots
primitive polynomials
algorytm probabilistyczny
generator grupy
grupy cykliczne
wielomian
Opis:
Generators of finite cyclic groups play important role in many cryptographic algorithms like public key ciphers, digital signatures, entity identification and key agreement algorithms. The above kinds of cryptographic algorithms are crucial for all secure communication in computer networks and secure information processing (in particular in mobile services, banking and electronic administration). In the paper, proofs of correctness of two probabilistic algorithms (for finding generators of finite cyclic groups and primitive roots) are given along with assessment of their average time computational complexity.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2015, 63, 4; 989-996
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Time complexity of page filling algorithms in Materialized Aggregate List (MAL) and MAL/TRIGG materialization cost
Autorzy:
Gorawski, M.
Powiązania:
https://bibliotekanauki.pl/articles/970792.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
spatial data warehouse
materialization
indexing
materialized aggregate list
time complexity of MAL algorithms
Opis:
The Materialized Aggregate List (MAL) enables effective storing and processing of long aggregates lists. The MAL structure contains an iterator table divided into pages that stores adequate number of aggregates. Time complexity of three algorithms was calculated and, in comparison with experimental results, the best configuration of MAL parameters (number of pages, single page size and number of database connections) was estimated. MAL can be also applied to every aggregation level in different indexing structures, like for instance the aR-tree.
Źródło:
Control and Cybernetics; 2009, 38, 1; 153-172
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Edge decompositions of multigraphs into multi-2-paths
Autorzy:
Kratochvil, J.
Lonc, Z.
Meszka, M.
Skupień, Z.
Powiązania:
https://bibliotekanauki.pl/articles/2050185.pdf
Data publikacji:
2004
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
edge decomposition
multigraph
multipath
path
time complexity
Opis:
We establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges. If the two edge multiplicities are distinct, the problem is NPC; if mutually equal then polynomial.
Źródło:
Opuscula Mathematica; 2004, 24, 1; 97-102
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A self–stabilizing algorithm for finding weighted centroid in trees
Autorzy:
Bielak, H.
Pańczyk, M.
Powiązania:
https://bibliotekanauki.pl/articles/106176.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
self-stabilizing algorithm
tree networks
time complexity
Opis:
In this paper we present some modification of the Blair and Manne algorithm for finding the center of a tree network in the distributed, self-stabilizing environment. Their algorithm finds n/2 -separator of a tree. Our algorithm finds weighted centroid, which is direct generalization of the former one for tree networks with positive weights on nodes. Time complexity of both algorithms is O(n2), where n is the number of nodes in the network.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2012, 12, 2; 27-37
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A New Optimization Algorithm for Dilation and Erosion
Autorzy:
Yin, K.
Powiązania:
https://bibliotekanauki.pl/articles/108794.pdf
Data publikacji:
2011
Wydawca:
Społeczna Akademia Nauk w Łodzi
Tematy:
dilation
erosion
optimization
iteration algorithm
time complexity analysis
Opis:
Effectively optimizing dilation and erosion is an extensively studied but not completely resolved problem. In this paper, a new optimization algorithm is proposed to improve the efficiency of dilation and erosion. Four notions are given to define the edges for any simply connected structuring element (SE). An assistant algorithm is proposed to detect these edges. Based on these notions, three iteration equations can be derived, which redefine dilation and erosion as iteration calculation. Time complexity of the new algorithm is reduced to O(n³). In addition, the new algorithm is suitable for online applications without the decomposition of SE. Simulation shows that with the same parameters, the performance of the new algorithm is better than that of Yang's algorithm.
Źródło:
Journal of Applied Computer Science Methods; 2011, 3 No. 1; 5-16
1689-9636
Pojawia się w:
Journal of Applied Computer Science Methods
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Entropic evolution of lexical richness of homogeneous texts over time : A dynamic complexity perspective
Autorzy:
Zhang, Y.
Powiązania:
https://bibliotekanauki.pl/articles/103947.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
dynamic complexity
lexical richness
entropy
homogenous texts
language modeling
Opis:
This work concerns the evolving pattern of the lexical richness of the corpus text of China Government Work Report measured by entropy, based on a fundamental assumption that these texts are linguistically homogeneous. The corpus is interpreted and studied as a dynamic system, the components of which maintain spontaneous variations, adjustment, self-organizations, and adaptations to fit into the semantic, discourse, and sociolinguistic functions that the text is set to perform. Both the macroscopic structural trend and the microscopic fluctuations of the time series of the interested entropic process are meticulously investigated from the dynamic complexity theoretical perspective. Rigorous nonlinear regression analysis is provided throughout the study for empirical justifications to the theoretical postulations. An overall concave model with modulated fluctuations incorporated is proposed and statistically tested to represent the key quantitative findings. Possible extensions of the current study are discussed.
Źródło:
Journal of Language Modelling; 2015, 3, 2; 569-599
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Philosopher Ahead of His Time. Ludwik Fleck and the Complexity of Science (Communication and Notes)
Autorzy:
Coco, Emanuele
Powiązania:
https://bibliotekanauki.pl/articles/41305356.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Filozofii i Socjologii PAN
Tematy:
philosophy of science
sociology of science
Thomas Kuhn
Ludwik Fleck
thought collective
thought style
Opis:
The new edition in Italian of the articles by the Polish microbiologist and philosopher Ludwik Fleck (1896-1961) edited by Francesco Coniglione offers the opportunity for some considerations around this significant scholar. Fleck anticipates Kuhn's ideas as well as those of the sociology of science. For him, any epistemology that does not take psychological and sociological methods into account, or that does not concern itself with economics, technology, art, and even politics, is an epistemology imaginabilis. Here we discuss some key points of the essays collected in the book, some observations taken from the rich introduction of the editor, and an inevitable question: Why has Fleck been neglected for so long?
Źródło:
Filozofia i Nauka; 2020, 8, 2; 177-183
2300-4711
2545-1936
Pojawia się w:
Filozofia i Nauka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Complexity of Creole Languages: The Fractal Approach
Autorzy:
Pietraszewska, Natalia
Powiązania:
https://bibliotekanauki.pl/articles/504770.pdf
Data publikacji:
2016
Wydawca:
Komisja Nauk Filologicznych Polskiej Akademii Nauk, Oddział we Wrocławiu
Tematy:
fractal dimension
language complexity
creole languages
time series
Opis:
The current paper aims to compare the complexity of texts translated into English-based creole languages and English. The main motivation for the choice of topic was the growing body of evidence that languages and language phenomena, such as texts, may be regarded as complex adaptable systems of signs. These systems may display some fractal properties, such as self-similarity at different scales. In consequence, texts may be analysed in the same manner as other fractal objects. It is possible, for instance, to estimate their fractal dimensions which, to some extent, reflect the degree of their structural complexity. Such an assumption enables one to calculate and compare fractal dimensions of parallel translations of texts to various languages in order to compare their complexity levels. Methods which enable comparisons of complexity of texts in different languages are particularly important with regard to creole languages, since the complexity of contact languages is still the subject of debate. In the following study, ten parallel translations of passages from the New Testament were mapped onto time series plots based on the length and the frequency rank of words. The values of Hurst exponent as well as fractal dimension were estimated and it was found that the studied time series did not differ significantly between English and English-based creoles with respect to their fractal dimensions. The results lend support to the idea that creole languages are simply new languages which are merely different from their superstrate language rather than being less complex, at least with regard to their lexical patterns.
Źródło:
Academic Journal of Modern Philology; 2015, 4; 73-80
2299-7164
2353-3218
Pojawia się w:
Academic Journal of Modern Philology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient Schur Parametrization and Modeling of p-Stationary Second-Order Time-Series for LPC Transmission
Autorzy:
Wielgus, A.
Zarzycki, J.
Powiązania:
https://bibliotekanauki.pl/articles/226070.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
second-order nonstationary time-series
linear Schur parametrization/modeling
complexity reduction
Opis:
Following the results presented in [21], we present an efficient approach to the Schur parametrization/modeling of a subclass of second-order time-series which we term p-stationary time-series, yielding a uniform hierarchy of algorithms suitable for efficient implementations and being a good starting point for nonlinear generalizations to higher-order non-Gaussian nearstationary time-series.
Źródło:
International Journal of Electronics and Telecommunications; 2018, 64, 3; 343-350
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-10 z 21

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies