Search for dissertations about: "greedy algorithms"

Showing result 1 - 5 of 24 swedish dissertations containing the words greedy algorithms.

  2. 1. Compressed Sensing : Algorithms and Applications

    Author : Dennis Sundman; Mikael Skoglund; Magnus Jansson; KTH; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; compressed sensing; greedy pursuits; subspace pursuit; orthogonal matching pursuit; power spectral density estimation; distributed compressed sensing;

    Abstract : The theoretical problem of finding the solution to an underdeterminedset of linear equations has for several years attracted considerable attentionin the literature. This problem has many practical applications.One example of such an application is compressed sensing (cs), whichhas the potential to revolutionize how we acquire and process signals. READ MORE

  4. 2. Greedy Algorithms for Distributed Compressed Sensing

    Author : Dennis Sundman; Mikael Skoglund; Chatterjee Saikat; Mads Græsbøll Christensen; KTH; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Electrical Engineering; Elektro- och systemteknik;

    Abstract : Compressed sensing (CS) is a recently invented sub-sampling technique that utilizes sparsity in full signals. Most natural signals possess this sparsity property. From a sub-sampled vector, some CS reconstruction algorithm is used to recover the full signal. READ MORE

  5. 3. Analysis of Algorithms for Combinatorial Auctions and Related Problems

    Author : Kidane Asrat Ghebreamlak; Svante Janson; Arne Andersson; Anders Johansson; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; combinatorial auctions; approximation algorithm; greedy algorithm; optimal strategy; MATHEMATICS; MATEMATIK;

    Abstract : The thesis consists of four papers on combinatorial auctions and a summary. The first part is more of a practical nature and contains two papers. In the first paper, we study the performance of a caching technique in an optimal algorithm for a multi-unit combinatorial auction. READ MORE

  6. 4. Cooperative Compressive Sampling

    Author : Ahmed Zaki; Lars Kildehøj; Saikat Chatterjee; Jan Østergaard; KTH; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Compressive sampling; greedy algorithms; convex optimisation; RIP analysis; fusion strategy; distributed learning; sparse learning; stochastic matrix; consensus; sparse estimation; Telecommunication; Telekommunikation;

    Abstract : Compressed Sampling (CS) is a promising technique capable of acquiring and processing data of large sizes efficiently. The CS technique exploits the inherent sparsity present in most real-world signals to achieve this feat. Most real-world signals, for example, sound, image, physical phenomenon etc., are compressible or sparse in nature. READ MORE

  7. 5. Signal Processing Techniques in Mobile Communication Systems : Signal Separation, Channel Estimation and Equalization

    Author : Ronnie Landqvist; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; wireless mobile communications; signal processing; blind source separation; independent component analysis; beamforming; water filling; greedy algorithm; exact eigendecomposition; eigenvector algorithm; multiple-input multiple-output systems; the projection approximation subspace tracking algorithm with and without deflation; linear and non-linear principal component analysis; whitening; decorrelation; equalization; antenna arrays;

    Abstract : Over the last decade there has been an explosive growth in the use of wireless mobile communications. Second generations systems are mature technologies now and third generation systems and beyond are being implemented and researched. READ MORE