Sökning: "recursive algorithms"
Visar resultat 1 - 5 av 63 avhandlingar innehållade orden recursive algorithms.
1. On Speech-to-Text Alignment, Phonetic Labeling, and Recursive Signal Processing
Sammanfattning : Speech data-bases are an important issue in the study of speech communication. In particular, time-aligned and phonetically labeled speech data-bases are useful during the design of applications such as speech recognizers. The time-alignment and labeling of the speech data is traditionally done manually. LÄS MER
2. Seismic tomography : Algorithms and applications
Sammanfattning : A preferred algorithm for seismic tomography needs to have capabilities including computational efficiency, minimal computer memory requirements, easy regularization and nonuniqueness analysis. In this thesis, regularised recursive least squares for seismic tomography is developed. LÄS MER
3. Recursive Blocked Algorithms, Data Structures, and High-Performance Software for Solving Linear Systems and Matrix Equations
Sammanfattning : This thesis deals with the development of efficient and reliable algorithms and library software for factorizing matrices and solving matrix equations on high-performance computer systems. The architectures of today's computers consist of multiple processors, each with multiple functional units. LÄS MER
4. Combating Intersymbol Interference and Cochannel Interference in Wireless Communication Systems
Sammanfattning : Over the last decade the world has witnessed explosive growth in the use of wireless mobile communications. Looking around we find users with mobile phones, wireless PDAs, pagers, MP3 players, and wireless headphones to connect to these devices - a small testament of the impact of wireless communications on our daily lives. LÄS MER
5. Distributed k-ary System: Algorithms for Distributed Hash Tables
Sammanfattning : This dissertation presents algorithms for data structures called distributed hash tables (DHT) or structured overlay networks, which are used to build scalable self-managing distributed systems. The provided algorithms guarantee lookup consistency in the presence of dynamism: they guarantee consistent lookup results in the presence of nodes joining and leaving. LÄS MER