# Search for dissertations about: "polynomial time"

Showing result 1 - 5 of 151 swedish dissertations containing the words polynomial time.

1. ## 1. Real-Time Workload Models : Expressiveness vs. Analysis Efficiency

Abstract : The requirements for real-time systems in safety-critical applications typically contain strict timing constraints. The design of such a system must be subject to extensive validation to guarantee that critical timing constraints will never be violated while the system operates. READ MORE

2. ## 2. Sensory Dynamics in Emulsion Products Differing in Fat Content

Abstract : Flavour, taste and texture are important qualities when purchasing food and the richness and smoothness of fat are desired properties for many individuals. However, fat is the major nutrition concern of many consumers. It is therefore important to be able to produce attractive products containing low amounts of fat. READ MORE

3. ## 3. Continuous-Time Models in Kernel Smoothing

Abstract : This thesis consists of five papers (Papers A-E) treating problems in non-parametric statistics, especially methods of kernel smoothing applied to density estimation for stochastic processes (Papers A-D) and regression analysis (Paper E). A recurrent theme is to, instead of treating highly positively correlated data as asymptotically independent'', take advantage of local dependence structures by using continuous-time models. READ MORE

4. ## 4. Perturbed Renewal Equations with Non-Polynomial Perturbations

Abstract : This thesis deals with a model of nonlinearly perturbed continuous-time renewal equation with nonpolynomial perturbations. The characteristics, namely the defect and moments, of the distribution function generating the renewal equation are assumed to have expansions with respect to a non-polynomial asymptotic scale: $\{\varphi_{\nn} (\varepsilon) =\varepsilon^{\nn \cdot \w}, \nn \in \mathbf{N}_0^k\}$  as $\varepsilon \to 0$, where $\mathbf{N}_0$ is the set of non-negative integers, \$\mathbf{N}_0^k \equiv \mathbf{N}_0 \times \cdots \times \mathbf{N}_0, 1\leq k . READ MORE

5. ## 5. Data driven modeling in the presence of time series structure: : Improved bounds and effective algorithms

Abstract : This thesis consists of five appended papers devoted to modeling tasks where the desired models are learned from data sets with an underlying time series structure. We develop a statistical methodology for providing efficient estimators and analyzing their non-asymptotic behavior. READ MORE 