In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures. We focus our attention on the equi-level (respectively equi-column) predicate constraining two time points to belong to
β¦ LIBER β¦
Symbolic representation of user-defined time granularities
β Scribed by Claudio Bettini; Roberto De Sibi
- Book ID
- 110353450
- Publisher
- Springer Netherlands
- Year
- 2000
- Tongue
- English
- Weight
- 348 KB
- Volume
- 30
- Category
- Article
- ISSN
- 1012-2443
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Definability and decidability of binary
β
Massimo Franceschet; Angelo Montanari; Adriano Peron; Guido Sciavicco
π
Article
π
2006
π
Elsevier Science
π
English
β 288 KB
Granulation-based symbolic representatio
β
Jun Meng; LiXia Wu; XiuKun Wang; TsauYoung Lin
π
Article
π
2011
π
Elsevier Science
π
English
β 627 KB
A symbolic computation procedure for the
β
Maucher, Roland
π
Article
π
1996
π
John Wiley and Sons
π
English
β 222 KB
π 2 views
The advance of powerful software for symbolic and numerical computations such as Mathernatica sheds a new light on a paper by Golub and Welsch from 1969. Based on this paper the author describes a Mathernatica procedure for determining the weights and abscissae of a Gauss quadrature rule with a user
Representations of algebras from varieti
β
J. PΕonka
π
Article
π
1995
π
Springer
π
English
β 751 KB
The Role of Duration Models and Symbolic
β
Caren Brinckmann; JΓΌrgen Trouvain
π
Article
π
2003
π
Springer US
π
English
β 86 KB
A user-defined data type for the storage
A user-defined data type for the storage of time series data allowing efficient similarity screening
β
Anatoly Sorokin; Gene Selkov; Igor Goryanin
π
Article
π
2012
π
Elsevier Science
π
English
β 210 KB