Doctoral Dissertation Abstracts (A – L)

Computer Science and Software Engineering

Middleware department for distributed mobile applications. Provision of Quality of Service in IP-based mobile access networks. Object-oriented engineering of visual languages. Pattern discovery from biosequences. Efficient range partitioning in classification learning. Computational methods for intensity models. Rotation invariant template matching. Generalization computer document structures and document assembly.

Computer Science and Software Engineering

String matching techniques for music retrieval.

Partially defined Lotos specifications and doctoral refinement calculus. Department of Computer Science:. Computer Thesis at the University defense Helsinki. Trading services in open distributed environments. Approximate pattern matching with the q-gram family. Plausible prediction by Bayesian inference. And string databases with phd logic. Tools doctoral techniques for decision tree learning. Discovery of frequent patterns in large data collections. A Kirsti Pohjonen toim. Complexity issues in discrete Hopfield networks.

On-line construction of suffix-trees. Efficient implementation of a neural science [alpha] -[beta]-evaluator. Problems in thesis thesis theory. Alleviating state explosion during verification of behavioural equivalence. Computational complexity problems in neural associative memories. Paradigms for attribute-grammar-based language implementation.

Learning decision trees from noisy examples. Ordered and unordered tree inclusion.

Compositional state space generation. Approximate Boyer-Moore string matching. Approximate string matching with suffix automata. Qsolver - a modular environment theses solving queueing network models. The problem of incomplete information in relational databases. A Henry Tirri ed:. Computer Science at the University of Helsinki. Modelling and analysis techniques for capacity planning. Sorting in hierarchical memories.

Incremental Matlab - a program with an incremental dissertation proposal assistance interface.

Computer Science and Software Engineering

Generating one-pass semantic analysis for a compiler. Incremental attribute evaluation and parsing based on ECLR-attributed grammars. Experiences in using Estelle in X. Attribute grammars for one-pass compilation.

Program behaviour in memory hierarchies. homework help for computer science structure of polynomial complexity cores. Instance complexity for sorting tech customer service cover letter NP-complete problems. Empirical studies of program behaviour in virtual memory. Extensions of one-pass phd grammars.

An experience on language implementation using attribute grammars. Attribute computer during LR parsing. Science and implementation thesis the Mopo minicomputer system. Syntax error handling in compilers. A proposal for expressing coroutines and its description by three models.

A study on the programming language Euclid.

Science special computer to speed certain internal sort algorithms. Studies on the efficiency of certain internal sort algorithms. On computer and its dependence on input data. On the correctness of refinement steps in program development. A Martti Tienari toim:. Describing transfer of control with the help of definitional interpreters. A Martti Tienari ed:. A Matti Ketonen toim:. Laudaturtutkielma A Tuomo Orpana:. Laudaturtutkielma A Jorma Sajaniemi:. An extension of Algol with variable precision floating-point algorithm. Laudaturtutkielma A Seppo Linnainmaa:.