Siirry päänavigointiin
Siirry hakuun
Siirry pääsisältöön
Tampereen yliopiston tutkimusportaali Etusivu
Tuki ja usein esitetyt kysymykset
English
Suomi
Etusivu
Profiilit
Tutkimustuotokset
Tutkimusyksiköt
Aktiviteetit
Tutkimusaineistot
Tutkimusinfrastruktuurit
Lehtileikkeet
Palkinnot
Haku asiantuntemuksen, nimen tai kytköksen perusteella
Greedy adaptive algorithms for sparse representations
Julkaisun otsikon käännös
:
Greedy adaptive algorithms for sparse representations
Alexandru Onose
Tutkimustuotos
:
Väitöskirja
›
Collection of Articles
154
Lataukset (Pure)
Yleiskatsaus
Sormenjälki
Sormenjälki
Sukella tutkimusaiheisiin 'Greedy adaptive algorithms for sparse representations'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.
Järjestys:
Painoarvo
Aakkosjärjestyksessä
Keyphrases
Adaptive Algorithm
100%
Adaptive Method
50%
Batch Matching
50%
Bayesian Information Criterion
50%
Coefficient Value
50%
Combinatorial Search
50%
Computational Optimization
50%
Computationally Efficient
50%
Configuration Parameters
50%
Convergence Rate
50%
Coordinate Descent
100%
Direction of Arrival
50%
Estimation Problem
50%
Estimation Theory
100%
Exhaustive Search
50%
Global Optimum
50%
Greedy
100%
Group Sparse
50%
Image Compressing
50%
Information Theoretic Criteria
100%
Inherent Characteristics
50%
Iterated Greedy Algorithm
50%
Least Squares
50%
Least Squares Criterion
100%
Local Solution
50%
Matching Pursuit
50%
Matching Pursuit Algorithms
50%
Model Sparsity
50%
Non-sparse
50%
Number of Zeros
50%
Numerical Complexity
50%
Numerical Computation
50%
Optimization Problem
50%
Orthogonal Least Squares
50%
Performance Guarantee
50%
Permutation-based
50%
QR Decomposition
50%
Selection Strategy
50%
Signal Processing
50%
Sliding Window
50%
Slow Variation
50%
Sparse Methods
50%
Sparse Model
100%
Sparse Representation
100%
Sparse Solution
100%
Sparse Structure
50%
Sparsity
50%
Sparsity Constraint
50%
Sparsity Level
50%
Sparsity-based Algorithm
50%
Structured Sparsity
50%
Support Selection
50%
Technological Progress
50%
Update Strategy
50%
Wireless Channel Estimation
50%
Zero Element
100%
Computer Science
Adaptive Algorithm
100%
Channel Estimation
16%
Coefficient Value
16%
Configuration Parameter
16%
Convergence Speed
16%
direction-of-arrival
16%
Exhaustive Search
16%
Good Performance
16%
Greedy Algorithm
16%
Information Criterion
16%
Least Squares Method
66%
Limiting Factor
16%
Matching Pursuit
33%
Nonzero Element
16%
Numerical Complexity
16%
Numerical Computation
16%
Optimization Problem
16%
Performance Guarantee
16%
Pursuit Algorithm
16%
Selection Strategy
16%
Sliding Window
16%
Sparse Representation
100%
Sparse Solution
33%
Sparsity
100%
Technological Advance
16%
Wireless Channel
16%
Engineering
Adaptive Method
16%
Channel Estimation
16%
Convergence Speed
16%
Direction of Arrival
16%
Exhaustive Search
16%
Global Optimum
16%
Good Performance
16%
Greedy Algorithm
16%
Inherent Characteristic
16%
Least Square
66%
Limiting Factor
16%
Main Step
16%
Matching Pursuit
33%
Model Parameter
16%
Nodes
16%
Nonzero Element
16%
Numerical Computation
16%
Optimisation Problem
16%
Pursuit Algorithm
16%
Selection Strategy
16%
Sparsity
100%
Technological Advance
16%