نتایج جستجو برای: log series

تعداد نتایج: 427006  

Journal: :Journal of the Australian Mathematical Society 1974

Journal: :Applied statistics 2021

Abstract System logs or log files containing textual messages with associated time stamps are generated by many technologies and systems. The clustering technique proposed in this paper provides a tool to discover identify patterns macrolevel events data. motivating application is frequency converters the propulsion system on ship, while general setting fault identification classification compl...

2009
Ken Kiyono

To quantify heavy-tailed distributions observed in financial time series, we propose a general method to characterize symmetric non-Gaussian distributions. In our approach, an observed time series is assumed to be described by the multiplication of Gaussian and amplitude random variables, where the amplitude variable describes fluctuations of the standard deviation. Based on this framework, it ...

2006
Arthur Brady Lenore Cowen

Distance labelings and compact routing schemes have both been active areas of recent research. It was already known that graphs with constant-sized recursive separators, such as trees, outerplanar graphs, series-parallel graphs and graphs of bounded treewidth, support both exact distance labelings and optimal (additive stretch 0, multiplicative stretch 1) compact routing schemes, but there are ...

Journal: :Journal of Computer and System Sciences 1989

1993
Hans L. Bodlaender

In this paper, we consider algorithms for maintaining tree-decompositions with constant bounded treewidth under edge and vertex insertions and deletions for graphs with treewidth at most 2 (also called: partial 2-trees, or series-parallel graphs), and for almost trees with parameter k. Each operation can be performed in O(log n) time. For a large number of graph decision, optimization and count...

Journal: :Journal of Mathematical Analysis and Applications 2010

Journal: :J. Algorithms 1997
Xiao Zhou Hitoshi Suzuki Takao Nishizeki

Many combinatorial problems can be efficiently solved in parallel for series]parallel multigraphs. The edge-coloring problem is one of a few combinatorial problems for which no NC parallel algorithm has been obtained for series]parallel multigraphs. This paper gives an NC parallel algorithm for the Ž . Ž . problem on series]parallel multigraphs G. It takes O log n time with O Dnrlog n processor...

Journal: :Mathematics 2023

By means of the telescoping method, we derived two general double series formulas that encapsulate Riemann zeta values ζ(s), Catalan constant G, log(2), π and several other significant mathematical constants.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید