Sciweavers

1734 search results - page 80 / 347
» its 2000
Sort
View
INFORMATICALT
2000
95views more  INFORMATICALT 2000»
14 years 9 months ago
Optimal Segmentation of Random Sequences
Abstract. This paper deals with maximum likelihood and least square segmentation of autoregressive random sequences with abruptly changing parameters. Conditional distribution of t...
Antanas Lipeika
INFORMATICALT
2000
82views more  INFORMATICALT 2000»
14 years 9 months ago
Recursive Algorithms of Time Series Observations Recognition
Abstract. The paper presents new method for sequential classification of the time series observations. Methods and algorithms of sequential recognition are obtained on the basis of...
Edward Shpilewski
IPL
2000
72views more  IPL 2000»
14 years 9 months ago
Generalized interpolation in CASL
In this paper we consider the partial many-sorted first-order logic and its extension to the subsorted partial many-sorted first-order logic that underly the Casl specification fo...
Tomasz Borzyszkowski
JACM
2000
119views more  JACM 2000»
14 years 9 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
JC
2000
89views more  JC 2000»
14 years 9 months ago
Weakly Computable Real Numbers
The Turing degree of a real number x is defined as the Turing degree of its binary expansion. This definition is quite natural and robust. In this paper we discuss some basic degr...
Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng