The following pages link to James Antonio Bucklew (Q1883267):
Displayed 41 items.
- (Q1098214) (redirect page) (← links)
- (Q1175394) (redirect page) (← links)
- Minimax estimation of continuous time deterministic signals in colored noise (Q1098215) (← links)
- Asymptotically optimal hypothesis testing with memory constraints (Q1175395) (← links)
- Introduction to rare event simulation. (Q1883268) (← links)
- Quick simulation of detector error probabilities in the presence of memory and nonlinearity (Q2726537) (← links)
- SEARCH STRATEGIES FOR FAILURE CASCADE PATHS IN POWER SYSTEM GRAPHS (Q2808349) (← links)
- Kernel techniques for generalized audio crossfades (Q2813520) (← links)
- Quantization schemes for bivariate Gaussian random variables (Q3050266) (← links)
- A note on the absolute epsilon entropy (Q3197747) (← links)
- Two results on the asymptotic performance of quantizers (Q3328435) (← links)
- Large deviation rate calculations for nonlinear detectors in Gaussian noise (Q3479309) (← links)
- Monte Carlo simulation and large deviations theory for uniformly recurrent Markov chains (Q3481001) (← links)
- On large deviations theory and asymptotically efficient Monte Carlo estimation (Q3481002) (← links)
- Conditional Importance Sampling Estimators (Q3546619) (← links)
- Universal Simulation Distributions (Q3546620) (← links)
- On the detectability of weak signals (Corresp.) (Q3690743) (← links)
- A note on the prediction error for small time lags into the future (Corresp.) (Q3709723) (← links)
- The source coding theorem via Sanov's theorem (Corresp.) (Q3780983) (← links)
- Minimax estimation of unknown deterministic signals in colored noise (Q3804596) (← links)
- Estimating random integrals from noisy observations: sampling designs and their performance (Q3817478) (← links)
- A large deviation theory proof of the abstract alphabet source coding theorem (Q3818233) (← links)
- Asymptotically optimal quantizers for detection of i.i.d (Q3835421) (← links)
- Two-dimensional quantization of bivariate circularly symmetric densities (Q3856596) (← links)
- Some properties of uniform step size quantizers (Corresp.) (Q3893794) (← links)
- Companding and random quantization in several dimensions (Q3908924) (← links)
- Properties of minimum mean squared error block quantizers (Corresp.) (Q3921144) (← links)
- Multidimensional asymptotic quantization theory with<tex>r</tex>th power distortion measures (Q3932730) (← links)
- Compressors for combined source and channel coding with applications to the generalized Gaussian family (Corresp.) (Q3966042) (← links)
- Excursions of adaptive algorithms via the Poisson clumping heuristic (Q4017823) (← links)
- A contribution to the theory of Chernoff bounds (Q4034462) (← links)
- A note on optimal quantization (Corresp.) (Q4178908) (← links)
- Weak convergence and local stability properties of fixed step size recursive algorithms (Q4277155) (← links)
- Poisson approximation for excursions of adaptive algorithms with a lattice state space (Q4340322) (← links)
- Convergence of a Class of Decentralized Beamforming Algorithms (Q4568722) (← links)
- Failure time analysis for LMS algorithms (Q4674473) (← links)
- The blind simulation problem and regenerative processes (Q4701217) (← links)
- A Maximum Likelihood Estimator of Channel Impulse Response (Q4739775) (← links)
- Adaptive Companded Pulse Code Modulation (Q4740466) (← links)
- A simple suboptimum estimator of prior probability in mixtures (Corresp.) (Q4742133) (← links)
- Mixed time scale recursive algorithms (Q5353503) (← links)
- A binary adaptive decision-selection equalizer for channels with nonlinear intersymbol interference (Q5353695) (← links)