- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 181 to 190 of 689 (0.095 seconds)Spelling suggestions: "subject:"mathematics anda estatistics"" "subject:"mathematics anda cstatistics""
| 181 |
One dimensional degenerate parabolic Anderson model with one-sided boundaryRiachi, Roland January 2023 (has links)
No description available.
|
| 182 |
Stability of Solutions to Stochastic Differential EquationsCheong, Bryden January 2023 (has links)
No description available.
|
| 183 |
Reproducing Kernel Hilbert spaces and feature learning in neural networksMarshall, Noah January 2023 (has links)
No description available.
|
| 184 |
Results in Parameter Estimation for Finite Markov ChainsDi Matteo, Gabriele January 2023 (has links)
No description available.
|
| 185 |
Central Limit Theorem and Large Deviations of the Maximum Likelihood EstimatorFortin, Clément January 2023 (has links)
No description available.
|
| 186 |
A bootstrap procedure for parameter estimation in the spatio-temporal epidemic-type aftershock sequence modelPeng, Renjie January 2023 (has links)
No description available.
|
| 187 |
Bicyclic Directed Triple SystemsGardner, Robert B. 01 August 1998 (has links) (PDF)
A directed triple system of order v, denoted DTS(v), is said to be bicyclic if it admits an automorphism whose disjoint cyclic decomposition consists of two cycles. In this paper, we give necessary and sufficient conditions for the existence of bicyclic DTS(v)s.
|
| 188 |
DISTANCES IN AN ARRAY: AN ALTERNATIVE DESCRIPTION FOR LARGE SCALE NETWORK TOPOLOGY.Norwood, Frederick, Dotson, William P. 01 January 1988 (has links)
In the complete graph on an (m, n) array, methods are given for finding how many links have a given length and for finding the average length of a link. A method is also given for finding the average length of a link in a graph where there is an upper bound on the length of a link.
|
| 189 |
Calculus: A Modern PerspectiveKnisley, Jeff 01 January 1997 (has links)
No description available.
|
| 190 |
Cyclic and Rotational Hybrid Triple SystemsGardner, Robert, Micale, Biagio, Pennisi, Mario, Zijlstra, Rebecca 15 October 1997 (has links)
A hybrid triple system of order v, denoted HTS(v), is said to be cyclic if it admits an automorphism consisting of a single cycle of length v. A HTS(v) admitting an automorphism consisting of a fixed point and a cycle of length v - 1 is said to be rotational. Necessary and sufficient conditions are given for the existence of a cyclic HTS(v) and a rotational HTS(v).
|
Page generated in 0.0981 seconds