Sökning: "Clustering Algorithm"
Visar resultat 1 - 5 av 81 avhandlingar innehållade orden Clustering Algorithm.
1. Approximation and Online Algorithms with Applications in Computational Biology and Computational Geometry
Sammanfattning : The main contributions of this thesis are in the area of approximation and online algorithm design and derivation of lower bounds on the approximability for a number of combinatorial optimization problems with applications in computational biology and computational geometry. Approximation and online algorithms are fundamental tools used to deal with computationally hard problems and problems in which the input is gradually disclosed over time. LÄS MER
Sammanfattning : This thesis consists of two parts.The first part considers further development of a model used for marital fertility, the Coale-Trussell's fertility model, which is based on age-specific fertility rates. A new model is suggested using individual fertility data and a waiting time after pregnancies. LÄS MER
Sammanfattning : Current predictions from industry envision that within a decade, the Internet will bepopulated by tens of billion of devices. Already today, smart Internet devices havesensors that provide an enormous potential for creating new applications. LÄS MER
Sammanfattning : The amount of data generated is on rise due to increased demand for fields like IoT, smart monitoring applications, etc. Data generated through such systems have many distinct characteristics like continuous data generation, evolutionary, multi-source nature, and heterogeneity. LÄS MER
Sammanfattning : This thesis studies the computational complexity and polynomial-time approximability of a number of discrete combinatorial optimization problems involving labeled trees and strings. The problems considered have applications to computational molecular biology, pattern matching, and many other areas of computer science. LÄS MER