Sökning: "box counting"
Visar resultat 1 - 5 av 6 avhandlingar innehållade orden box counting.
1. Characterization of real fractal objects : analysis of the box-counting approach with applications to gas-evaporated aggregates
Sammanfattning : .... LÄS MER
2. Topics in multifractal measures, nonparametrics and biostatistics
Sammanfattning : This thesis consists of four papers. The first two papers, which comprise the main part of the thesis, deal with an unexpected connection between kernel density estimators and dimension spectra for multifractal measures. LÄS MER
3. Algorithmic Graph Problems - From Computer Networks to Graph Embeddings
Sammanfattning : This dissertation is a contribution to the knowledge of the computational complexity of discrete combinatorial problems. 1. The first problem that we consider is to compute the maximum independent set of a box graph, that is, given a set of orthogonal boxes in the plane compute the largest subset such that no boxes in the subset overlap. LÄS MER
4. Flow cytometry for bioprocess control
Sammanfattning : During bio-technical processing it is important to monitorbiological parameters such as cell growth, viability andproduct formation. Many of the analyses traditionally used areslow to perform and provide only average data for thepopulation. LÄS MER
5. Bayesian inference in probabilistic graphical models
Sammanfattning : This thesis consists of four papers studying structure learning and Bayesian inference in probabilistic graphical models for both undirected and directed acyclic graphs (DAGs).Paper A presents a novel algorithm, called the Christmas tree algorithm (CTA), that incrementally construct junction trees for decomposable graphs by adding one node at a time to the underlying graph. LÄS MER