Sökning: "Binary Search Tree"

Visar resultat 6 - 10 av 10 avhandlingar innehållade orden Binary Search Tree.

1. 6. Multifont recognition System for Ethiopic Script

   Författare :Yaregal Assabie Lake; Josef Bigun; Högskolan i Halmstad; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Ethiopic character recognition; OCR; Multifont recognition; Amharic; Direction fields; Structural and syntactic pattern recognition; Image analysis; Bildanalys;

   Sammanfattning : In this thesis, we present a general framework for multi-font, multi-size and multi-style Ethiopic character recognition system. We propose structural and syntactic techniques for recognition of Ethiopic characters where the graphically comnplex characters are represented by less complex primitive structures and their spatial interrelationships. LÄS MER

3. 7. On Complexity Certification of Branch-and-Bound Methods for MILP and MIQP with Applications to Hybrid MPC

   Författare :Shamisa Shoja; Daniel Axehill; Martin Enqvist; Jan Kronqvist; Linköpings universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

   Sammanfattning : In model predictive control (MPC), an optimization problem is solved at each time step, in which the system dynamics and constraints can directly be taken into account. The MPC concept can be further extended to the control of hybrid systems, where a part of the state and control variables has a discrete set of values. LÄS MER

4. 8. Testing and Proving in Dependent Type Theory

   Författare :Qiao Haiyan; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : We show how random testing, model checking and interactive proving can be combined for functional program verification in dependent type theory. We extend the proof assistant Agda/Alfa for dependent type theory with a tool for random testing of functional programs, thus combining proving and testing in one system. LÄS MER

5. 9. On Robust LPC-spectrum Coding and Vector Quantization

   Författare :Roar Hagen; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; robustness against channel noise; LPC-spectrum coding; vector quantization; speech coding; linear mapping of a block code;

   Sammanfattning : Digital speech coding is concerned with representing a discrete-time speech signal with as few bits per second as possible without introducing annoying artifacts in the coded speech. Many modern speech coders are based on Linear Predictive Coding (LPC) which employ a source-filter model for speech production. LÄS MER

7. 10. Dynamic algorithms: new worst-case and instance-optimal bounds via new connections

   Författare :Thatchaphol Saranurak; Danupon Nanongkai; Piotr Sankowski; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Science; Datalogi;

   Sammanfattning : This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly maintaining some information of an input data undergoing a sequence of updates. The first question asks \emph{how small the update time for handling each update can be} for each dynamic problem. LÄS MER