| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. B. John Oommen 57 Sang-Woon Kim , B. John Oommen: Optimizing Kernel-Based Nonlinear Subspace Methods Using Prototype Reduction Schemes. Australian Joint Conference on Artificial Intelligence 2002 : 155-166 56 Sang-Woon Kim , B. John Oommen: Recursive Prototype Reduction Schemes Applicable for Large Data Sets. SSPR/SPR 2002 : 528-537 55 Luís G. Rueda , B. John Oommen: On Optimal Pairwise Linear Classifiers for Normal Distributions: The Two-Dimensional Case. IEEE Transactions on Pattern Analysis and Machine Intelligence 24 (2): 274-280 (2002) 54 Luís G. Rueda , B. John Oommen, Resolving Minsky's Paradox : The d-Dimensional Normal Distribution Case. Australian Joint Conference on Artificial Intelligence 2001 : 25-36 53 B. John Oommen, Luís G. Rueda : Histogram Methods in Query Optimization: The Relation between Accuracy and Optimality. DASFAA 2001 : 320-326 52 Gopal Racherla , Sridhar Radhakrishnan , B. John Oommen: A New Geometric Tool for Pattern Recognition - An Algorithm for Real Time Insertion of Layered Segment Trees. ICAPR 2001 : 212-221 51 B. John Oommen, Qun Wang : Distance Bias Adjustment Bootstrap Estimation for Bhattacharyya Error Bound in Classifiers. PRIS 2001 : 103-117 50 B. John Oommen, R. K. S. Loke : On the Pattern Recognition of Noisy Subsequence Trees. IEEE Transactions on Pattern Analysis and Machine Intelligence 23 (9): 929-946 (2001) 49 B. John Oommen, Luís G. Rueda : An Empirical Comparison of Histogram-Like Techniques for Query Optimization. ICEIS 2000 : 71-78 48 B. John Oommen, Murali Thiyagarajah : Query Result Size Estimation Using the Trapezoidal Attribute Cardinality Map. IDEAS 2000 : 236-242 47 M. Ouerd , B. John Oommen, Stan Matwin : A Formalism for Building Causal Polytree Structures Using Data Distributions. ISMIS 2000 : 629-637 46 Luís G. Rueda , B. John Oommen: The Foundational Theory of Optimal Bayesian Pairwise Linear Classifiers. SSPR/SPR 2000 : 581-590 45 B. John Oommen, T. Dale Roberts : Continuous Learning Automata Solutions to the Capacity Assignment Problem. IEEE Transactions on Computers 49 (6): 608-620 (2000) 44 Murali Thiyagarajah , B. John Oommen: On Benchmarking Attribute Cardinality Maps for Database Systems Using the TPC-D Specification. DEXA 1999 : 292-301 43 Murali Thiyagarajah , B. John Oommen: Prototype Validation of the Trapezoidal Attribute Cardinality Map for Query Optimization in Database Systems. ICEIS 1999 : 156-162 42 B. John Oommen, Murali Thiyagarajah : Query Result Size Estimation Using a Novel Histogram-like Technique: The Rectangular Attribute Cardinality Map. IDEAS 1999 : 3-15 41 B. John Oommen, T. Dale Roberts : On Solving the Capacity Assignment Problem Using Continous Learning Automata. IEA/AIE 1999 : 622-631 40 B. John Oommen, T. Dale Roberts : A Fast Efficient Solution to the Capacity Assignment Problem Using Discretized Learning Automata. IEA/AIE (Vol. 2) 1998 : 56-65 39 B. John Oommen, R. K. S. Loke : The Noisy Subsequence Tree Recognition Problem. SSPR/SPR 1998 : 169-180 38 B. John Oommen, Juan Dong : Generalized Swap-with-Parent Schemes for Self-Organizing Sequential Linear Lists. ISAAC 1997 : 414-423 37 Qingxin Zhu , B. John Oommen: On the Optimal Search Problem: The Case when the Target Distribution is Unknown. SCCC 1997 : 268-277 36 Thai B. Nguyen , B. John Oommen: Moment-Preserving Piecewise Linear Approximations of Signals and Images. IEEE Transactions on Pattern Analysis and Machine Intelligence 19 (1): 84-91 (1997) 35 I. Kuban Altinel , B. John Oommen, Necati Aras : Vector Quantization for Arbitrary Distance Function Estimation. INFORMS Journal on Computing 9 (4): 439-451 (1997) 34 B. John Oommen, R. K. S. Loke : Optimal and Information Theoretic Syntactic Pattern Recognition Involving Traditional and Transposition Errors. FSTTCS 1996 : 224-237 33 B. John Oommen, Rangasami L. Kashyap : Optimal and Information Theoretic Syntactic Pattern Recognition for Traditional Errors. SSPR 1996 : 11-20 32 B. John Oommen, K. Zhang , W. Lee : Numerical Similarity and Dissimilarity Measures Between Two Trees. IEEE Transactions on Computers 45 (12): 1426-1434 (1996) 31 B. John Oommen, Edward V. de St. Croix : Graph Partitioning Using Learning Automata. IEEE Transactions on Computers 45 (2): 195-208 (1996) 30 B. John Oommen, K. Zhang : The Normalized String Editing Problem Revisited. IEEE Transactions on Pattern Analysis and Machine Intelligence 18 (6): 669-672 (1996) 29 B. John Oommen, R. K. S. Loke : Noisy Subsequence Recognition Using Constrained String Editing Involving Substitutions, Insertions, Deletions and Generalized Transpositions. ICSC 1995 : 116-123 28 B. John Oommen, Edward V. de St. Croix : On Using Learning Automata for Fast Graph Partitioning. LATIN 1995 : 449-460 27 B. John Oommen: String Alignment with Substitution, Insertion, Deletion, Squashing and Expansion Operations. Information Sciences 83 (1&2): 89-107 (1995) 26 B. John Oommen, William Lee : Contrained Tree Editing. Information Sciences 77 (3-4): 253-273 (1994) 25 B. John Oommen, David T. H. Ng : A New Technique for Enhancing Linked-List Data Retrieval: Reorganize Data Using Artificially synthesized Queries. The Computer Journal 37 (7): 598-609 (1994) 24 B. John Oommen, J. R. Zgierski : Breaking Substitution Cyphers Using Stochastic Automata. IEEE Transactions on Pattern Analysis and Machine Intelligence 15 (2): 185-192 (1993) 23 R. S. Valiveti , B. John Oommen: Self-Organizing Doubly-Linked Lists. J. Algorithms 14 (1): 88-114 (1993) 22 B. John Oommen, David T. H. Ng : An Optimal Absorbing List Organization Strategy with Constant Memory Requirements. TCS 119 (2): 355-361 (1993) 21 Robert P. Cheetham , B. John Oommen, David T. H. Ng : Adaptive Structuring of Binary Search Trees Using Conditional Rotations. TKDE 5 (4): 695-704 (1993) 20 B. John Oommen: Transforming Ill-Conditioned Constrained Problems using Projections. The Computer Journal 36 (3): 282-285 (1993) 19 B. John Oommen, Chris Fothergill : Fast Learning Automaton-Based Image Examination and Retrieval. The Computer Journal 36 (6): 542-553 (1993) 18 David T. H. Ng , B. John Oommen: A Short Note on Doubly-Linked List Reorganizing Heuristics. The Computer Journal 35 (5): 533-535 (1992) 17 R. S. Valiveti , B. John Oommen, J. R. Zgierski : Adaptive Linear List Reorganization for a System Processing Set Queries. FCT 1991 : 405-414 16 R. S. Valiveti , B. John Oommen: Recognizing Sources of Random Strings. IEEE Transactions on Pattern Analysis and Machine Intelligence 13 (4): 386-394 (1991) 15 B. John Oommen, R. S. Valiveti , J. R. Zgierski : A Fast Learning Automaton Solution to the Keyboard Optimization Problem. IEA/AIE (Vol. 2) 1990 : 981-990 14 B. John Oommen, E. R. Hansen , J. Ian Munro : Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies. TCS 74 (2): 183-197 (1990) 13 B. John Oommen, David T. H. Ng : On Generating Random Permutations with Arbitrary Distributions. The Computer Journal 33 (4): 368-374 (1990) 12 B. John Oommen, David T. H. Ng : On Generating Random Permutations with Arbitrary Distributions. ACM Conference on Computer Science 1989 : 27-32 11 David T. H. Ng , B. John Oommen: Generalizing Singly-Linked List Reorganizing Heuristics for Doubly-Linked Lists. MFCS 1989 : 380-389 10 B. John Oommen, David T. H. Ng : Optimal Constant Space Move-to-Rear List Organization. Optimal Algorithms 1989 : 115-125 9 Robert P. Cheetham , B. John Oommen, David T. H. Ng : On Using Conditional Rotation Operations to Adaptively Structure Binary Search Trees. ICDT 1988 : 161-175 8 B. John Oommen, Daniel C. Y. Ma : Deterministic Learning Automata Solutions to the Equipartitioning Problem. IEEE Transactions on Computers 37 (1): 2-13 (1988) 7 B. John Oommen: Correction to "Recognition of Noisy Subsequences Using Constrained Edit Distances". IEEE Transactions on Pattern Analysis and Machine Intelligence 10 (6): 983-984 (1988) 6 B. John Oommen, Daniel C. Y. Ma : Fast Object Partitioning Using Stochastic Learning Automata. SIGIR 1987 : 111-122 5 B. John Oommen, E. R. Hansen : List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations. SIAM J. Comput. 16 (4): 705-716 (1987) 4 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. AAAI 1986 : 1101-1106 3 B. John Oommen, E. R. Hansen : Expedient Stochastic Move-to-Front and optimal Move-to-Rear List Organizing Strategies. ICDT 1986 : 349-364 2 B. John Oommen: Algorithms for String Editing which Permit Arbitrarily Complex Editing Constraints. MFCS 1984 : 443-451 1 Rangasami L. Kashyap , B. John Oommen: The Noisy Substring Matching Problem. TSE 9 (3): 365-370 (1983)  DiSC'02 © 2003 Association for Computing Machinery |
