The following pages link to Petr Tichavský (Q217826):
Displaying 34 items.
- Numerical CP decomposition of some difficult tensors (Q508007) (← links)
- Asymptotic noise gain of polynomial predictors (Q1127305) (← links)
- Recursive estimation of frequencies and frequency rates of multiple cisoids in noise (Q1391581) (← links)
- Blind separation of piecewise stationary non-Gaussian sources (Q1957699) (← links)
- Probabilistic inference with noisy-threshold models based on a CP tensor decomposition (Q2440189) (← links)
- An Approximate Tensor-Based Inference Method Applied to the Game of Minesweeper (Q2938430) (← links)
- Speed and Accuracy Enhancement of Linear ICA Techniques Using Rational Nonlinear Functions (Q3608561) (← links)
- Blind Instantaneous Noisy Mixture Separation with Best Interference-Plus-Noise Rejection (Q3608626) (← links)
- (Q3827455) (← links)
- Large error recovery for a class of frequency tracking algorithms (Q4210716) (← links)
- High-SNR asymptotics for signal-subspace methods in sinusoidal frequency estimation (Q4275219) (← links)
- Adaptive estimation for periodic signal enhancement and tracking (Q4312779) (← links)
- Comparative study of four adaptive frequency trackers (Q4355506) (← links)
- Corrections to “Performance Analysis of the FastICA Algorithm and CramÉr–Rao Bounds for Linear Independent Component Analysis” (Q4568637) (← links)
- Fast Approximate Joint Diagonalization Incorporating Weight Matrices (Q4571579) (← links)
- Tensor Deflation for CANDECOMP/PARAFAC— Part I: Alternating Subspace Update Algorithm (Q4580904) (← links)
- Tensor Deflation for CANDECOMP/PARAFAC— Part II: Initialization and Error Analysis (Q4580905) (← links)
- Performance analysis of the FastICA algorithm and Crame/spl acute/r-rao bounds for linear independent component analysis (Q4587733) (← links)
- Gradient Algorithms for Complex Non-Gaussian Independent Component/Vector Extraction, Question of Convergence (Q4628261) (← links)
- Error Preserving Correction: A Method for CP Decomposition at a Target Error Bound (Q4628271) (← links)
- Two algorithms for adaptive retrieval of slowly time-varying multiple cisoids in noise (Q4838228) (← links)
- (Q4909818) (← links)
- Performance Bounds for Complex-Valued Independent Vector Analysis (Q5102970) (← links)
- Cramér–Rao Bounds for Complex-Valued Independent Component Extraction: Determined and Piecewise Determined Mixing Models (Q5103078) (← links)
- Dynamic Independent Component/Vector Analysis: Time-Variant Linear Mixtures Separable by Time-Invariant Beamformers (Q5103493) (← links)
- Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC (Q5300549) (← links)
- Quasi-Fluid-Mechanics-Based Quasi-Bayesian CramÉr–Rao Bounds for Deformed Towed-Array Direction Finding (Q5353960) (← links)
- Analytical derivation of finite-data-record performance of Wong-Lok-Lehnert-Zoltowski's DS-CDMA "Blind" space-time receiver (Q5355700) (← links)
- Filtering, predictive, and smoothing Cramér-Rao bounds for discrete-time nonlinear dynamic systems (Q5950245) (← links)
- Non-Orthogonal Tensor Diagonalization (Q6511594) (← links)
- Best Rank-One Tensor Approximation and Parallel Update Algorithm for CPD (Q6511816) (← links)
- Error Preserving Correction for CPD and Bounded-Norm CPD (Q6511817) (← links)
- Double nonstationarity: blind extraction of independent nonstationary vector/component from nonstationary mixtures -- algorithms (Q6603180) (← links)
- Grid-based Bayesian filters with functional decomposition of transient density (Q6603365) (← links)
