B. John Oommen

From MaRDI portal
Person:456037

Available identifiers

zbMath Open oommen.b-johnWikidataQ6251285 ScholiaQ6251285MaRDI QIDQ456037

List of research outcomes

PublicationDate of PublicationType
Pioneering approaches for enhancing the speed of hierarchical LA by \textit{ordering} the actions2023-09-08Paper
On using learning automata for fast graph partitioning2022-08-16Paper
A novel technique for stochastic root-finding: enhancing the search with adaptive \(d\)-ary search2020-02-07Paper
The design of absorbing Bayesian pursuit algorithms and the formal analyses of their \(\varepsilon\)-optimality2019-11-20Paper
Stochastic discretized learning-based weak estimation: a novel estimation method for non-stationary environments2019-05-29Paper
On the cryptanalysis of two cryptographic algorithms that utilize chaotic neural networks2018-08-27Paper
Routing Bandwidth-Guaranteed Paths in MPLS Traffic Engineering: A Multiple Race Track Learning Approach2018-06-12Paper
On the analysis of a random walk-jump chain with tree-based transitions and its applications to faulty dichotomous search2018-05-03Paper
Solving Stochastic Nonlinear Resource Allocation Problems Using a Hierarchy of Twofold Resource Allocation Automata2017-07-27Paper
On achieving semi-supervised pattern recognition by utilizing tree-based SOMs2012-10-23Paper
Achieving Unbounded Resolution inFinitePlayer Goore Games Using Stochastic Automata, and Its Applications2012-06-01Paper
On the Analysis of a Random Interleaving Walk–Jump Process with Applications to Testing2011-12-28Paper
https://portal.mardi4nfdi.de/entity/Q30744652011-02-08Paper
Cybernetics and Learning Automata2010-11-30Paper
Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions2010-10-19Paper
Multi-class pairwise linear dimensionality reduction using heteroscedastic schemes2010-05-11Paper
AI 2003: Advances in Artificial Intelligence2009-08-07Paper
On using prototype reduction schemes to enhance the computation of volume-based inter-class overlap measures2009-07-29Paper
Spikes annihilation in the Hodgkin-Huxley neuron2008-08-15Paper
A formal analysis of why heuristic functions work2007-10-23Paper
Breadth-first search strategies for trie-based syntactic pattern recognition2007-09-20Paper
Periodicity and stability issues of a chaotic pattern recognition neural network2007-09-20Paper
Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of Reference2007-09-14Paper
On Optimizing the k-Ward Micro-aggregation Technique for Secure Statistical Databases2007-09-07Paper
On using prototype reduction schemes to optimize dissimilarity-based classification2007-08-27Paper
On the estimation of independent binomial random variables using occurrence and sequential information2007-08-27Paper
A novel look-ahead optimization strategy for trie-based approximate string matching2006-11-22Paper
KI 2005: Advances in Artificial Intelligence2006-11-13Paper
Stochastic learning-based weak estimation of multinomial random variables and its applications to pattern recognition in non-stationary environments2006-05-22Paper
A fast and efficient nearly-optimal adaptive Fano coding scheme2006-05-16Paper
Prototype reduction schemes applicable for non-stationary data sets2005-12-07Paper
Structural, Syntactic, and Statistical Pattern Recognition2005-08-24Paper
Structural, Syntactic, and Statistical Pattern Recognition2005-08-24Paper
A nearly-optimal Fano-based coding algorithm2004-10-04Paper
https://portal.mardi4nfdi.de/entity/Q48089942004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44751232004-08-09Paper
The Efficiency of Histogram-like Techniques for Database Query Optimization2004-03-16Paper
On using prototype reduction schemes to optimize kernel-based nonlinear subspace methods.2004-03-14Paper
Graph partitioning using learning automata2003-11-10Paper
Enhancing prototype reduction schemes with LVQ3-type algorithms2003-08-28Paper
https://portal.mardi4nfdi.de/entity/Q44151442003-07-28Paper
Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects2003-02-20Paper
On optimal pairwise linear classifiers for normal distributions: The \(d\)-dimensional case2003-02-11Paper
https://portal.mardi4nfdi.de/entity/Q45365382002-11-05Paper
https://portal.mardi4nfdi.de/entity/Q27634232002-01-15Paper
Adaptive linear list reorganization under a generalized query system1996-06-10Paper
An optimal absorbing list organization strategy with constant memory requirements1994-02-09Paper
Transforming Ill-Continued Constrained Problems using Projections1993-08-08Paper
Self-Organizing Doubly-Linked Lists1993-05-16Paper
On the problem of multiple mobile robots cluttering a workspace1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39751621992-06-26Paper
Deterministic optimal and expedient move-to-rear list organizing strategies1990-01-01Paper
Discretized pursuit learning automata1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34843461989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37982551988-01-01Paper
Deterministic learning automata solutions to the equipartitioning problem1988-01-01Paper
epsilon -optimal discretized linear reward-penalty learning automata1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38117451988-01-01Paper
An Efficient Geometric Solution to the Minimum Spanning Circle Problem1987-01-01Paper
List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations1987-01-01Paper
Recognition of Noisy Subsequences Using Constrained Edit Distances1987-01-01Paper
Constrained string editing1986-01-01Paper
Absorbing and Ergodic Discretized Two-Action Learning Automata1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859631986-01-01Paper
Multiaction learning automata possessing ergodicity of the mean1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32176171984-01-01Paper
The asymptotic optimality of discretized linear reward-inaction learning automata1984-01-01Paper
Learning automata processing ergodicity of the mean: The two-action case1983-01-01Paper
Scale Preserving Smoothing of Polygons1983-01-01Paper
A common basis for similarity measures involving two strings†1983-01-01Paper
Similarity measures for sets of strings1983-01-01Paper
The Noisy Substring Matching Problem1983-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: B. John Oommen