The following pages link to B. John Oommen (Q456037):
Displaying 50 items.
- On achieving semi-supervised pattern recognition by utilizing tree-based SOMs (Q456038) (← links)
- An optimal absorbing list organization strategy with constant memory requirements (Q688166) (← links)
- Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions (Q710617) (← links)
- A novel look-ahead optimization strategy for trie-based approximate string matching (Q851727) (← links)
- Deterministic optimal and expedient move-to-rear list organizing strategies (Q914378) (← links)
- (Q937715) (redirect page) (← links)
- Spikes annihilation in the Hodgkin-Huxley neuron (Q937717) (← links)
- Multi-class pairwise linear dimensionality reduction using heteroscedastic schemes (Q969086) (← links)
- Multiaction learning automata possessing ergodicity of the mean (Q1067787) (← links)
- Constrained string editing (Q1099954) (← links)
- On the problem of multiple mobile robots cluttering a workspace (Q1193826) (← links)
- Enhancing prototype reduction schemes with LVQ3-type algorithms (Q1402668) (← links)
- On using prototype reduction schemes to optimize kernel-based nonlinear subspace methods. (Q1425937) (← links)
- On the cryptanalysis of two cryptographic algorithms that utilize chaotic neural networks (Q1665747) (← links)
- On optimal pairwise linear classifiers for normal distributions: The \(d\)-dimensional case (Q1856628) (← links)
- Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects (Q1860195) (← links)
- A nearly-optimal Fano-based coding algorithm (Q1881249) (← links)
- On using prototype reduction schemes to enhance the computation of volume-based inter-class overlap measures (Q2270741) (← links)
- A novel technique for stochastic root-finding: enhancing the search with adaptive \(d\)-ary search (Q2293151) (← links)
- The design of absorbing Bayesian pursuit algorithms and the formal analyses of their \(\varepsilon\)-optimality (Q2337586) (← links)
- Stochastic learning-based weak estimation of multinomial random variables and its applications to pattern recognition in non-stationary environments (Q2369547) (← links)
- Breadth-first search strategies for trie-based syntactic pattern recognition (Q2383946) (← links)
- Periodicity and stability issues of a chaotic pattern recognition neural network (Q2383948) (← links)
- Stochastic discretized learning-based weak estimation: a novel estimation method for non-stationary environments (Q2417825) (← links)
- A formal analysis of why heuristic functions work (Q2457670) (← links)
- A fast and efficient nearly-optimal adaptive Fano coding scheme (Q2489208) (← links)
- Prototype reduction schemes applicable for non-stationary data sets (Q2575825) (← links)
- On using prototype reduction schemes to optimize dissimilarity-based classification (Q2643878) (← links)
- On the estimation of independent binomial random variables using occurrence and sequential information (Q2643914) (← links)
- (Q2763423) (← links)
- Achieving Unbounded Resolution in<i>Finite</i>Player Goore Games Using Stochastic Automata, and Its Applications (Q2888572) (← links)
- Cybernetics and Learning Automata (Q3059842) (← links)
- (Q3074465) (← links)
- On the Analysis of a Random Interleaving Walk–Jump Process with Applications to Testing (Q3106540) (← links)
- (Q3217617) (← links)
- The asymptotic optimality of discretized linear reward-inaction learning automata (Q3219112) (← links)
- Learning automata processing ergodicity of the mean: The two-action case (Q3323275) (← links)
- (Q3484346) (← links)
- Discretized pursuit learning automata (Q3493280) (← links)
- Scale Preserving Smoothing of Polygons (Q3674087) (← links)
- Absorbing and Ergodic Discretized Two-Action Learning Automata (Q3746893) (← links)
- An Efficient Geometric Solution to the Minimum Spanning Circle Problem (Q3770262) (← links)
- (Q3785963) (← links)
- (Q3798255) (← links)
- Deterministic learning automata solutions to the equipartitioning problem (Q3801077) (← links)
- List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations (Q3801086) (← links)
- epsilon -optimal discretized linear reward-penalty learning automata (Q3805915) (← links)
- Recognition of Noisy Subsequences Using Constrained Edit Distances (Q3811744) (← links)
- (Q3811745) (← links)
- A common basis for similarity measures involving two strings† (Q3962481) (← links)
