The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

B. John Oommen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. B. John Oommen, E. R. Hansen
    List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:4, pp:705-716 [Journal]
  2. B. John Oommen, E. R. Hansen, J. Ian Munro
    Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:74, n:2, pp:183-197 [Journal]
  3. Robert P. Cheetham, B. John Oommen, David T. H. Ng
    Adaptive Structuring of Binary Search Trees Using Conditional Rotations. [Citation Graph (1, 11)][DBLP]
    IEEE Trans. Knowl. Data Eng., 1993, v:5, n:4, pp:695-704 [Journal]
  4. Rangasami L. Kashyap, B. John Oommen
    The Noisy Substring Matching Problem. [Citation Graph (1, 0)][DBLP]
    IEEE Trans. Software Eng., 1983, v:9, n:3, pp:365-370 [Journal]
  5. B. John Oommen, Jack R. Zgierski, Doron Nussbaum
    Deterministic Majority filters applied to stochastic sorting. [Citation Graph (0, 0)][DBLP]
    ACM Southeast Regional Conference, 2004, pp:228-233 [Conf]
  6. Xavier Hilaire, B. John Oommen
    The averaged mappings problem: statement, applications, and approximate solution. [Citation Graph (0, 0)][DBLP]
    ACM Southeast Regional Conference, 2006, pp:24-29 [Conf]
  7. Ghada Badr, B. John Oommen
    On using conditional rotations and randomized heuristics for self-organizing ternary search tries. [Citation Graph (0, 0)][DBLP]
    ACM Southeast Regional Conference (1), 2005, pp:109-115 [Conf]
  8. Sudip Misra, B. John Oommen
    Adaptive Algorithms for Routing and Traffic Engineering in Stochastic Networks. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:993-994 [Conf]
  9. B. John Oommen, S. Sitharama Iyengar, Nageswara S. V. Rao, Rangasami L. Kashyap
    Robot Navigation in Unknown Terrains of Convex Polygonal Obstacles Using Learned Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    AAAI, 1986, pp:1101-1106 [Conf]
  10. Ebaa Fayyoumi, B. John Oommen
    On Optimizing the k-Ward Micro-aggregation Technique for Secure Statistical Databases. [Citation Graph (0, 0)][DBLP]
    ACISP, 2006, pp:324-335 [Conf]
  11. B. John Oommen, David T. H. Ng
    On Generating Random Permutations with Arbitrary Distributions. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1989, pp:27-32 [Conf]
  12. Luís G. Rueda, B. John Oommen
    On Families of New Adaptive Compression Algorithms Suitable for Time-Varying Source Data. [Citation Graph (0, 0)][DBLP]
    ADVIS, 2004, pp:234-244 [Conf]
  13. Ouerd Messaouda, B. John Oommen, Stan Matwin
    Enhancing Caching in Distributed Databases Using Intelligent Polytree Representations. [Citation Graph (0, 0)][DBLP]
    Canadian Conference on AI, 2003, pp:498-504 [Conf]
  14. Denis V. Batalov, B. John Oommen
    Turning Lights Out with DQ-Learning. [Citation Graph (0, 0)][DBLP]
    Artificial Intelligence and Applications, 2006, pp:451-456 [Conf]
  15. Sudip Misra, B. John Oommen
    The Pursuit Automaton Approach for Estimating All-Pairs Shortest Paths in Dynamically Changing Networks. [Citation Graph (0, 0)][DBLP]
    AINA Workshops (1), 2007, pp:124-129 [Conf]
  16. Sang-Woon Kim, B. John Oommen
    Optimizing Kernel-Based Nonlinear Subspace Methods Using Prototype Reduction Schemes. [Citation Graph (0, 0)][DBLP]
    Australian Joint Conference on Artificial Intelligence, 2002, pp:155-166 [Conf]
  17. Sang-Woon Kim, B. John Oommen
    On Using Prototype Reduction Schemes and Classifier Fusion Strategies to Optimize Kernel-Based Nonlinear Subspace Methods. [Citation Graph (0, 0)][DBLP]
    Australian Conference on Artificial Intelligence, 2003, pp:783-795 [Conf]
  18. Sang-Woon Kim, B. John Oommen
    Selecting Subspace Dimensions for Kernel-Based Nonlinear Subspace Classifiers Using Intelligent Search Methods. [Citation Graph (0, 0)][DBLP]
    Australian Conference on Artificial Intelligence, 2004, pp:1115-1121 [Conf]
  19. Sang-Woon Kim, B. John Oommen
    Time-Varying Prototype Reduction Schemes Applicable for Non-stationary Data Sets. [Citation Graph (0, 0)][DBLP]
    Australian Conference on Artificial Intelligence, 2005, pp:614-623 [Conf]
  20. B. John Oommen, Ole-Christoffer Granmo, Asle Pedersen
    Empirical Verification of a Strategy for Unbounded Resolution in Finite Player Goore Games. [Citation Graph (0, 0)][DBLP]
    Australian Conference on Artificial Intelligence, 2006, pp:1252-1258 [Conf]
  21. B. John Oommen, Govindachari Raghunath, Benjamin Kuipers
    On How to Learn from a Stochastic Teacher or a Stochastic Compulsive Liar of Unknown Identity. [Citation Graph (0, 0)][DBLP]
    Australian Conference on Artificial Intelligence, 2003, pp:24-40 [Conf]
  22. Luís G. Rueda, B. John Oommen
    Resolving Minsky's Paradox: The d-Dimensional Normal Distribution Case. [Citation Graph (0, 0)][DBLP]
    Australian Joint Conference on Artificial Intelligence, 2001, pp:25-36 [Conf]
  23. B. John Oommen
    On the Futility of Arbitrarily Increasing Memory Capabilities of Stochastic Learning Automata. [Citation Graph (0, 0)][DBLP]
    CAIA, 1985, pp:308-312 [Conf]
  24. B. John Oommen, Luís G. Rueda
    Histogram Methods in Query Optimization: The Relation between Accuracy and Optimality. [Citation Graph (0, 0)][DBLP]
    DASFAA, 2001, pp:320-326 [Conf]
  25. Murali Thiyagarajah, B. John Oommen
    On Benchmarking Attribute Cardinality Maps for Database Systems Using the TPC-D Specification. [Citation Graph (0, 0)][DBLP]
    DEXA, 1999, pp:292-301 [Conf]
  26. Necati Aras, I. Kuban Altinel, B. John Oommen
    A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE. [Citation Graph (0, 0)][DBLP]
    ECAI, 2000, pp:261-265 [Conf]
  27. Radhakrishna S. Valiveti, B. John Oommen, Jack R. Zgierski
    Adaptive Linear List Reorganization for a System Processing Set Queries. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:405-414 [Conf]
  28. B. John Oommen, R. K. S. Loke
    Optimal and Information Theoretic Syntactic Pattern Recognition Involving Traditional and Transposition Errors. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:224-237 [Conf]
  29. Ghada Badr, B. John Oommen
    Enhancing Trie-Based Syntactic Pattern Recognition Using AI Heuristic Search Strategies. [Citation Graph (0, 0)][DBLP]
    ICAPR (1), 2005, pp:1-17 [Conf]
  30. Gopal Racherla, Sridhar Radhakrishnan, B. John Oommen
    A New Geometric Tool for Pattern Recognition - An Algorithm for Real Time Insertion of Layered Segment Trees. [Citation Graph (0, 0)][DBLP]
    ICAPR, 2001, pp:212-221 [Conf]
  31. Robert P. Cheetham, B. John Oommen, David T. H. Ng
    On Using Conditional Rotation Operations to Adaptively Structure Binary Search Trees. [Citation Graph (0, 8)][DBLP]
    ICDT, 1988, pp:161-175 [Conf]
  32. B. John Oommen, E. R. Hansen
    Expedient Stochastic Move-to-Front and optimal Move-to-Rear List Organizing Strategies. [Citation Graph (0, 7)][DBLP]
    ICDT, 1986, pp:349-364 [Conf]
  33. B. John Oommen, Jing Chen
    On Utilizing Attribute Cardinality Maps to Enhance Query Optimization in the Oracle Database System. [Citation Graph (0, 0)][DBLP]
    ICEIS (1), 2006, pp:23-35 [Conf]
  34. B. John Oommen, Luis Rueda
    An Empirical Comparison of Histogram-Like Techniques for Query Optimization. [Citation Graph (0, 0)][DBLP]
    ICEIS, 2000, pp:71-78 [Conf]
  35. Murali Thiyagarajah, B. John Oommen
    Prototype Validation of the Trapezoidal Attribute Cardinality Map for Query Optimization in Database Systems. [Citation Graph (0, 0)][DBLP]
    ICEIS, 1999, pp:156-162 [Conf]
  36. Sang-Woon Kim, B. John Oommen
    On Optimizing Dissimilarity-Based Classification Using Prototype Reduction Schemes. [Citation Graph (0, 0)][DBLP]
    ICIAR (1), 2006, pp:15-28 [Conf]
  37. B. John Oommen, R. K. S. Loke
    Noisy Subsequence Recognition Using Constrained String Editing Involving Substitutions, Insertions, Deletions and Generalized Transpositions. [Citation Graph (0, 0)][DBLP]
    ICSC, 1995, pp:116-123 [Conf]
  38. B. John Oommen, Murali Thiyagarajah
    Query Result Size Estimation Using the Trapezoidal Attribute Cardinality Map. [Citation Graph (0, 0)][DBLP]
    IDEAS, 2000, pp:236-242 [Conf]
  39. B. John Oommen, Murali Thiyagarajah
    Query Result Size Estimation Using a Novel Histogram-like Technique: The Rectangular Attribute Cardinality Map. [Citation Graph (0, 0)][DBLP]
    IDEAS, 1999, pp:3-15 [Conf]
  40. Sudip Misra, B. John Oommen
    Stochastic Learning Automata-Based Dynamic Algorithms for the Single Source Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    IEA/AIE, 2004, pp:239-248 [Conf]
  41. B. John Oommen, T. Dale Roberts
    A Fast Efficient Solution to the Capacity Assignment Problem Using Discretized Learning Automata. [Citation Graph (0, 0)][DBLP]
    IEA/AIE (Vol. 2), 1998, pp:56-65 [Conf]
  42. B. John Oommen, T. Dale Roberts
    On Solving the Capacity Assignment Problem Using Continous Learning Automata. [Citation Graph (0, 0)][DBLP]
    IEA/AIE, 1999, pp:622-631 [Conf]
  43. B. John Oommen, Radhakrishna S. Valiveti, Jack R. Zgierski
    A Fast Learning Automaton Solution to the Keyboard Optimization Problem. [Citation Graph (0, 0)][DBLP]
    IEA/AIE (Vol. 2), 1990, pp:981-990 [Conf]
  44. Geir Horn, B. John Oommen
    A Fixed-Structure Learning Automaton Solution to the Stochastic Static Mapping Problem. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  45. B. John Oommen, Juan Dong
    Generalized Swap-with-Parent Schemes for Self-Organizing Sequential Linear Lists. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:414-423 [Conf]
  46. Sudip Misra, B. John Oommen
    Generalized pursuit learning algorithms for shortest path routing tree computation. [Citation Graph (0, 0)][DBLP]
    ISCC, 2004, pp:891-896 [Conf]
  47. Sudip Misra, B. John Oommen
    New Algorithms for Maintaining All-Pairs Shortest Paths. [Citation Graph (0, 0)][DBLP]
    ISCC, 2005, pp:116-121 [Conf]
  48. Luís G. Rueda, B. John Oommen
    Efficient Adaptive Data Compression Using Fano Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    ISCIS, 2005, pp:768-779 [Conf]
  49. M. Ouerd, B. John Oommen, Stan Matwin
    A Formalism for Building Causal Polytree Structures Using Data Distributions. [Citation Graph (0, 0)][DBLP]
    ISMIS, 2000, pp:629-637 [Conf]
  50. B. John Oommen, Luís G. Rueda
    On Utilizing Stochastic Learning Weak Estimators for Training and Classification of Patterns with Non-stationary Distributions. [Citation Graph (0, 0)][DBLP]
    KI, 2005, pp:107-120 [Conf]
  51. B. John Oommen, Edward V. de St. Croix
    On Using Learning Automata for Fast Graph Partitioning. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:449-460 [Conf]
  52. David T. H. Ng, B. John Oommen
    Generalizing Singly-Linked List Reorganizing Heuristics for Doubly-Linked Lists. [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:380-389 [Conf]
  53. B. John Oommen
    Algorithms for String Editing which Permit Arbitrarily Complex Editing Constraints. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:443-451 [Conf]
  54. B. John Oommen, Jack R. Zgierski, Doron Nussbaum
    Stochastic Sorting Using Deterministic Consecutive and Leader Filters. [Citation Graph (0, 0)][DBLP]
    MSV/AMCS, 2004, pp:399-405 [Conf]
  55. B. John Oommen, David T. H. Ng
    Optimal Constant Space Move-to-Rear List Organization. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:115-125 [Conf]
  56. Qun Wang, B. John Oommen
    Classification Error-Rate Estimation Using New Pseudo-Sample Bootstrap Methods. [Citation Graph (0, 0)][DBLP]
    PRIS, 2003, pp:96-103 [Conf]
  57. B. John Oommen
    Recent Results on Learning from Stochastic Teachers and Compulsive Liars/Con-Men. [Citation Graph (0, 0)][DBLP]
    PRIS, 2004, pp:4- [Conf]
  58. B. John Oommen, Luís G. Rueda
    Using Pattern Recognition Techniques to Derive a Formal Analysis of Why Heuristics Functions Work. [Citation Graph (0, 0)][DBLP]
    PRIS, 2002, pp:45-58 [Conf]
  59. B. John Oommen, Qun Wang
    Distance Bias Adjustment Bootstrap Estimation for Bhattacharyya Error Bound in Classifiers. [Citation Graph (0, 0)][DBLP]
    PRIS, 2001, pp:103-117 [Conf]
  60. Qun Wang, B. John Oommen
    On Designing Pattern Classifiers Using Artificially Created Bootstrap Samples. [Citation Graph (0, 0)][DBLP]
    PRIS, 2004, pp:159-168 [Conf]
  61. Sang-Woon Kim, B. John Oommen
    On Utilizing LVQ3-Type Algorithms to Enhance Prototype Reduction Schemes. [Citation Graph (0, 0)][DBLP]
    PRIS, 2002, pp:242-256 [Conf]
  62. Ebaa Fayyoumi, B. John Oommen
    A Fixed Structure Learning Automaton Micro-aggregation Technique for Secure Statistical Databases. [Citation Graph (0, 0)][DBLP]
    Privacy in Statistical Databases, 2006, pp:114-128 [Conf]
  63. Qingxin Zhu, B. John Oommen
    On the Optimal Search Problem: The Case when the Target Distribution is Unknown. [Citation Graph (0, 0)][DBLP]
    SCCC, 1997, pp:268-277 [Conf]
  64. Dragos Calitoiu, B. John Oommen, Dorin Nusbaumm
    Modeling Inaccurate Perception: Desynchronization Issues of a Chaotic Pattern Recognition Neural Network. [Citation Graph (0, 0)][DBLP]
    SCIA, 2005, pp:821-830 [Conf]
  65. B. John Oommen, Daniel C. Y. Ma
    Fast Object Partitioning Using Stochastic Learning Automata. [Citation Graph (0, 0)][DBLP]
    SIGIR, 1987, pp:111-122 [Conf]
  66. Sang-Woon Kim, B. John Oommen
    Recursive Prototype Reduction Schemes Applicable for Large Data Sets. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2002, pp:528-537 [Conf]
  67. Sang-Woon Kim, B. John Oommen
    On Optimizing Kernel-Based Fisher Discriminant Analysis Using Prototype Reduction Schemes. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2006, pp:826-834 [Conf]
  68. B. John Oommen, Ghada Badr
    Dictionary-Based Syntactic Pattern Recognition Using Tries. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2004, pp:251-259 [Conf]
  69. B. John Oommen, Rangasami L. Kashyap
    Optimal and Information Theoretic Syntactic Pattern Recognition for Traditional Errors. [Citation Graph (0, 0)][DBLP]
    SSPR, 1996, pp:11-20 [Conf]
  70. B. John Oommen, Sang-Woon Kim, Geir Horn
    On the Theory and Applications of Sequence Based Estimation of Independent Binomial Random Variables. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2006, pp:8-21 [Conf]
  71. B. John Oommen, R. K. S. Loke
    The Noisy Subsequence Tree Recognition Problem. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 1998, pp:169-180 [Conf]
  72. B. John Oommen, Luís G. Rueda
    A New Family of Weak Estimators for Training in Non-stationary Distributions. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2004, pp:644-652 [Conf]
  73. Luis Rueda, B. John Oommen
    The Foundational Theory of Optimal Bayesian Pairwise Linear Classifiers. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2000, pp:581-590 [Conf]
  74. Abdelrahman Amer, B. John Oommen
    Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of Reference. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:109-120 [Conf]
  75. B. John Oommen, Luís G. Rueda
    A formal analysis of why heuristic functions work. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2005, v:164, n:1-2, pp:1-22 [Journal]
  76. Ghada Hany Badr, B. John Oommen
    Self-Adjusting of Ternary Search Tries Using Conditional Rotations and Randomized Heuristics. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2005, v:48, n:2, pp:200-219 [Journal]
  77. David T. H. Ng, B. John Oommen
    A Short Note on Doubly-Linked List Reorganizing Heuristics. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1992, v:35, n:5, pp:533-535 [Journal]
  78. B. John Oommen
    Transforming Ill-Conditioned Constrained Problems using Projections. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1993, v:36, n:3, pp:282-285 [Journal]
  79. B. John Oommen, Chris Fothergill
    Fast Learning Automaton-Based Image Examination and Retrieval. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1993, v:36, n:6, pp:542-553 [Journal]
  80. B. John Oommen, David T. H. Ng
    On Generating Random Permutations with Arbitrary Distributions. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1990, v:33, n:4, pp:368-374 [Journal]
  81. B. John Oommen, David T. H. Ng
    A New Technique for Enhancing Linked-List Data Retrieval: Reorganize Data Using Artificially synthesized Queries. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1994, v:37, n:7, pp:598-609 [Journal]
  82. B. John Oommen, Luís G. Rueda
    The Efficiency of Histogram-like Techniques for Database Query Optimization. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2002, v:45, n:5, pp:494-510 [Journal]
  83. I. Kuban Altinel, B. John Oommen, Necati Aras
    Vector Quantization for Arbitrary Distance Function Estimation. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 1997, v:9, n:4, pp:439-451 [Journal]
  84. Luís G. Rueda, B. John Oommen
    A nearly-optimal Fano-based coding algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Manage., 2004, v:40, n:2, pp:257-268 [Journal]
  85. Rangasami L. Kashyap, B. John Oommen
    An effective algorithm for string correction using generalized edit distances--I. Description of the algorithm and its optimality. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1981, v:23, n:2, pp:123-142 [Journal]
  86. Rangasami L. Kashyap, B. John Oommen
    An effective algorithm for string correction using generalized edit distance - II. Computational complexity of the algorithm and some applications. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1981, v:23, n:3, pp:201-217 [Journal]
  87. B. John Oommen
    Constrained string editing. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1986, v:40, n:3, pp:267-284 [Journal]
  88. B. John Oommen
    String Alignment with Substitution, Insertion, Deletion, Squashing and Expansion Operations. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1995, v:83, n:1&2, pp:89-107 [Journal]
  89. B. John Oommen, William Lee
    Constrained Tree Editing. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1994, v:77, n:3-4, pp:253-273 [Journal]
  90. B. John Oommen, I. Reichstein
    On the problem of multiple mobile robots cluttering a workspace. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1992, v:63, n:1-2, pp:55-85 [Journal]
  91. B. John Oommen, M. A. L. Thathachar
    Multiaction learning automata possessing ergodicity of the mean. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1985, v:35, n:3, pp:183-198 [Journal]
  92. M. Ouerd, B. John Oommen, Stan Matwin
    A formal approach to using data distributions for building causal polytree structures. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2004, v:168, n:1-4, pp:111-132 [Journal]
  93. Luis Rueda, B. John Oommen
    A fast and efficient nearly-optimal adaptive Fano coding scheme. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2006, v:176, n:12, pp:1656-1683 [Journal]
  94. Radhakrishna S. Valiveti, B. John Oommen
    Self-Organizing Doubly-Linked Lists. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:1, pp:88-114 [Journal]
  95. Necati Aras, B. John Oommen, I. Kuban Altinel
    The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem. [Citation Graph (0, 0)][DBLP]
    Neural Networks, 1999, v:12, n:9, pp:1273-1284 [Journal]
  96. Sang-Woon Kim, B. John Oommen
    A brief taxonomy and ranking of creative prototype reduction schemes. [Citation Graph (0, 0)][DBLP]
    Pattern Anal. Appl., 2003, v:6, n:3, pp:232-244 [Journal]
  97. Ghada Badr, B. John Oommen
    A novel look-ahead optimization strategy for trie-based approximate string matching. [Citation Graph (0, 0)][DBLP]
    Pattern Anal. Appl., 2006, v:9, n:2-3, pp:177-187 [Journal]
  98. B. John Oommen, Ghada Hany Badr
    Breadth-first search strategies for trie-based syntactic pattern recognition. [Citation Graph (0, 0)][DBLP]
    Pattern Anal. Appl., 2007, v:10, n:1, pp:1-13 [Journal]
  99. Sang-Woon Kim, B. John Oommen
    On Utilizing Search Methods to Select Subspace Dimensions for Kernel-Based Nonlinear Subspace Classifiers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2005, v:27, n:1, pp:136-141 [Journal]
  100. Sang-Woon Kim, B. John Oommen
    On Using Prototype Reduction Schemes and Classifier Fusion Strategies to Optimize Kernel-Based Nonlinear Subspace Methods. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2005, v:27, n:3, pp:455-460 [Journal]
  101. B. John Oommen
    Correction to "Recognition of Noisy Subsequences Using Constrained Edit Distances". [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1988, v:10, n:6, pp:983-984 [Journal]
  102. B. John Oommen, R. K. S. Loke
    On the Pattern Recognition of Noisy Subsequence Trees. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2001, v:23, n:9, pp:929-946 [Journal]
  103. Thai B. Nguyen, B. John Oommen
    Moment-Preserving Piecewise Linear Approximations of Signals and Images. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1997, v:19, n:1, pp:84-91 [Journal]
  104. B. John Oommen, Jack R. Zgierski
    Breaking Substitution Cyphers Using Stochastic Automata. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1993, v:15, n:2, pp:185-192 [Journal]
  105. B. John Oommen, K. Zhang
    The Normalized String Editing Problem Revisited. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1996, v:18, n:6, pp:669-672 [Journal]
  106. Luís G. Rueda, B. John Oommen
    On Optimal Pairwise Linear Classifiers for Normal Distributions: The Two-Dimensional Case. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2002, v:24, n:2, pp:274-280 [Journal]
  107. Radhakrishna S. Valiveti, B. John Oommen
    Recognizing Sources of Random Strings. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1991, v:13, n:4, pp:386-394 [Journal]
  108. Sang-Woon Kim, B. John Oommen
    Enhancing prototype reduction schemes with LVQ3-type algorithms. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2003, v:36, n:5, pp:1083-1093 [Journal]
  109. Sang-Woon Kim, B. John Oommen
    On using prototype reduction schemes to optimize kernel-based nonlinear subspace methods. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2004, v:37, n:2, pp:227-239 [Journal]
  110. Sang-Woon Kim, B. John Oommen
    Prototype reduction schemes applicable for non-stationary data sets. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2006, v:39, n:2, pp:209-222 [Journal]
  111. B. John Oommen, Rangasami L. Kashyap
    A formal theory for optimal and information theoretic syntactic pattern recognition. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1998, v:31, n:8, pp:1159-1177 [Journal]
  112. B. John Oommen, Richard K. S. Loke
    Pattern recognition of strings with substitutions, insertions, deletions and generalized transpositions. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1997, v:30, n:5, pp:789-800 [Journal]
  113. B. John Oommen, Luis Rueda
    Stochastic learning-based weak estimation of multinomial random variables and its applications to pattern recognition in non-stationary environments. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2006, v:39, n:3, pp:328-341 [Journal]
  114. Gopal Racherla, Sridhar Radhakrishnan, B. John Oommen
    Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2002, v:35, n:10, pp:2303-2309 [Journal]
  115. Luís G. Rueda, B. John Oommen
    On optimal pairwise linear classifiers for normal distributions: the d-dimensional case. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2003, v:36, n:1, pp:13-23 [Journal]
  116. Radhakrishna S. Valiveti, B. John Oommen
    On using the chi-squared metric for determining stochastic dependence. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1992, v:25, n:11, pp:1389-1400 [Journal]
  117. Radhakrishna S. Valiveti, B. John Oommen
    Determining stochastic dependence for normally distributed vectors using the chi-squared metric. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1993, v:26, n:6, pp:975-987 [Journal]
  118. Sudip Misra, B. John Oommen
    An Efficient Dynamic Algorithm for Maintaining All-Pairs Shortest Paths in Stochastic Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2006, v:55, n:6, pp:686-702 [Journal]
  119. B. John Oommen, Edward V. de St. Croix
    Graph Partitioning Using Learning Automata. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:2, pp:195-208 [Journal]
  120. B. John Oommen, Daniel C. Y. Ma
    Deterministic Learning Automata Solutions to the Equipartitioning Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1988, v:37, n:1, pp:2-13 [Journal]
  121. B. John Oommen, T. Dale Roberts
    Continuous Learning Automata Solutions to the Capacity Assignment Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2000, v:49, n:6, pp:608-620 [Journal]
  122. B. John Oommen, K. Zhang, William Lee
    Numerical Similarity and Dissimilarity Measures Between Two Trees. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:12, pp:1426-1434 [Journal]
  123. B. John Oommen, Sudip Misra, Ole-Christoffer Granmo
    Routing Bandwidth-Guaranteed Paths in MPLS Traffic Engineering: A Multiple Race Track Learning Approach. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2007, v:56, n:7, pp:959-976 [Journal]
  124. B. John Oommen, David T. H. Ng
    An Optimal Absorbing List Organization Strategy with Constant Memory Requirements. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:119, n:2, pp:355-361 [Journal]
  125. Pradeep K. Atrey, Mohan S. Kankanhalli, B. John Oommen
    Goal-oriented optimal subset selection of correlated multimedia streams. [Citation Graph (0, 0)][DBLP]
    TOMCCAP, 2007, v:3, n:1, pp:- [Journal]
  126. M. Agache, B. John Oommen
    Generalized pursuit learning schemes: new families of continuous and discretized learning automata. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part B, 2002, v:32, n:6, pp:738-749 [Journal]
  127. Sang-Woon Kim, B. John Oommen
    Enhancing prototype reduction schemes with recursion: a method applicable for "large" data sets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part B, 2004, v:34, n:3, pp:1384-1397 [Journal]
  128. Sudip Misra, B. John Oommen
    Dynamic algorithms for the shortest path routing problem: learning automata-based solutions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part B, 2005, v:35, n:6, pp:1179-1192 [Journal]
  129. B. John Oommen
    Stochastic searching on the line and its applications to parameter learning in nonlinear optimization. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part B, 1997, v:27, n:4, pp:733-739 [Journal]
  130. B. John Oommen, M. Agache
    Continuous and discretized pursuit learning schemes: various algorithms and their comparison. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part B, 2001, v:31, n:3, pp:277-287 [Journal]
  131. B. John Oommen, I. Kuban Altinel, Necati Aras
    Discrete vector quantization for arbitrary distance function estimation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part B, 1998, v:28, n:4, pp:496-510 [Journal]
  132. B. John Oommen, Edward V. de St. Croix
    String taxonomy using learning automata. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part B, 1997, v:27, n:2, pp:354-365 [Journal]
  133. B. John Oommen, R. K. S. Loke
    Designing syntactic pattern classifiers using vector quantization and parametric string editing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part B, 1999, v:29, n:6, pp:881-888 [Journal]
  134. B. John Oommen, T. Dale Roberts
    Discretized learning automata solutions to the capacity assignment problem for prioritized networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part B, 2002, v:32, n:6, pp:821-831 [Journal]
  135. B. John Oommen, Govindachari Raghunath
    Automata learning and intelligent tertiary searching for stochastic point location. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part B, 1998, v:28, n:6, pp:947-954 [Journal]
  136. B. John Oommen, Murali Thiyagarajah
    Benchmarking attribute cardinality maps for database systems using the TPC-D specifications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part B, 2003, v:33, n:6, pp:913-924 [Journal]
  137. Dragos Calitoiu, B. John Oommen, Doron Nussbaum
    Analytic Results on the Hodgkin-Huxley Neural Network: Spikes Annihilation. [Citation Graph (0, 0)][DBLP]
    Canadian Conference on AI, 2007, pp:320-331 [Conf]
  138. Dragos Calitoiu, B. John Oommen, Doron Nussbaum
    Numerical Results on the Hodgkin-Huxley Neural Network: Spikes Annihilation. [Citation Graph (0, 0)][DBLP]
    BVAI, 2007, pp:378-387 [Conf]
  139. B. John Oommen, Ebaa Fayyoumi
    A Novel Method for Micro-Aggregation in Secure Statistical Databases Using Association and Interaction. [Citation Graph (0, 0)][DBLP]
    ICICS, 2007, pp:126-140 [Conf]
  140. M. Khaled Hashem, B. John Oommen
    On Using Learning Automata to Model a Student's Behavior in a Tutorial-like System. [Citation Graph (0, 0)][DBLP]
    IEA/AIE, 2007, pp:813-822 [Conf]
  141. B. John Oommen, Sang-Woon Kim, Mathew Samuel, Ole-Christoffer Granmo
    Stochastic Point Location in Non-stationary Environments and Its Applications. [Citation Graph (0, 0)][DBLP]
    IEA/AIE, 2007, pp:845-854 [Conf]
  142. B. John Oommen, Sudip Misra, Ole-Christoffer Granmo
    A Stochastic Random-Races Algorithm for Routing in MPLS Traffic Engineering. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  143. B. John Oommen, Jing Chen
    A new histogram method for sparse attributes: the averaged rectangular attribute cardinality map. [Citation Graph (0, 0)][DBLP]
    ISICT, 2003, pp:119-125 [Conf]
  144. Abdelrahman Amer, B. John Oommen
    A Novel Framework for Self-Organizing Lists in Environments with Locality of Reference: Lists-on-Lists. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2007, v:50, n:2, pp:186-196 [Journal]
  145. Dragos Calitoiu, B. John Oommen, Doron Nussbaum
    Periodicity and stability issues of a chaotic pattern recognition neural network. [Citation Graph (0, 0)][DBLP]
    Pattern Anal. Appl., 2007, v:10, n:3, pp:175-188 [Journal]
  146. B. John Oommen, Sang-Woon Kim, Geir Horn
    On the estimation of independent binomial random variables using occurrence and sequential information. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2007, v:40, n:11, pp:3263-3276 [Journal]
  147. Sang-Woon Kim, B. John Oommen
    On using prototype reduction schemes to optimize dissimilarity-based classification. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2007, v:40, n:11, pp:2946-2957 [Journal]

  148. Enhancing Micro-Aggregation Technique by Utilizing Dependence-Based Information in Secure Statistical Databases. [Citation Graph (, )][DBLP]


  149. A Fast Computation of Inter-class Overlap Measures Using Prototype Reduction Schemes. [Citation Graph (, )][DBLP]


  150. Potential AI Strategies to Solve the Commons Game: A Position Paper. [Citation Graph (, )][DBLP]


  151. An AI-Based Causal Strategy for Securing Statistical Databases Using Micro-aggregation. [Citation Graph (, )][DBLP]


  152. Some Analysis on the Network of Bursting Neurons: Quantifying Behavioral Synchronization. [Citation Graph (, )][DBLP]


  153. On Using a Hierarchy of Twofold Resource Allocation Automata to Solve Stochastic Nonlinear Resource Allocation Problems. [Citation Graph (, )][DBLP]


  154. On Using Adaptive Binary Search Trees to Enhance Self Organizing Maps. [Citation Graph (, )][DBLP]


  155. Chernoff-Based Multi-class Pairwise Linear Dimensionality Reduction. [Citation Graph (, )][DBLP]


  156. On Enhancing Query Optimization in the Oracle Database System by Utilizing Attribute Cardinality Maps. [Citation Graph (, )][DBLP]


  157. A Hierarchy of Twofold Resource Allocation Automata Supporting Optimal Web Polling. [Citation Graph (, )][DBLP]


  158. A Hierarchy of Twofold Resource Allocation Automata Supporting Optimal Sampling. [Citation Graph (, )][DBLP]


  159. Learning Automata Based Intelligent Tutorial-like System. [Citation Graph (, )][DBLP]


  160. Learning Automaton Based On-Line Discovery and Tracking of Spatio-temporal Event Patterns. [Citation Graph (, )][DBLP]


  161. Using learning automata to model the behavior of a teacher in a tutorial-like system. [Citation Graph (, )][DBLP]


  162. Using learning automata to model a student-classroom interaction in a tutorial-like system. [Citation Graph (, )][DBLP]


  163. Chaotic Pattern Recognition: The Spectrum of Properties of the Adachi Neural Network. [Citation Graph (, )][DBLP]


  164. Language Detection and Tracking in Multilingual Documents Using Weak Estimators. [Citation Graph (, )][DBLP]


  165. On Utilizing Optimal and Information Theoretic Syntactic Modeling for Peptide Classification. [Citation Graph (, )][DBLP]


  166. Modeling and simulating a disease outbreak by learning a contagion parameter-based model. [Citation Graph (, )][DBLP]


  167. Large scale modeling of the piriform cortex for analyzing antiepileptic effects. [Citation Graph (, )][DBLP]


  168. Anomaly Detection in Dynamic Social Systems Using Weak Estimators. [Citation Graph (, )][DBLP]


  169. Neural Network-Based Chaotic Pattern Recognition - Part 2: Stability and Algorithmic Issues. [Citation Graph (, )][DBLP]


  170. A Look-Ahead Branch and Bound Pruning Scheme for Trie-Based Approximate String Matching. [Citation Graph (, )][DBLP]


  171. A Generic Solution to Multi-Armed Bernoulli Bandit Problems based on Random Sampling from Sibling Conjugate Priors. [Citation Graph (, )][DBLP]


  172. On using Simulation and Stochastic Learning for Pattern Recognition When Training Data is Unavailable - The Case of Disease Outbreak. [Citation Graph (, )][DBLP]


  173. Spikes annihilation in the Hodgkin-Huxley neuron. [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.020secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002