Now showing items 1-10 of 10

  • Custom programming/analysis in the small business environment 

    Cary, T. (IEEE, 1976-09)
    As has often been stated, a business of any size can be considered as a general system,8,11,13,28,29,20,31with identifiable external inputs and outputs typically consisting of goods, services, energy, money, and information. ...
  • On combinational networks with restricted fan-out 

    Kodandapani, K.L.; Seth, S.C. (IEEE, 1978-04)
    Fan-out-free networks of AND, OR, NOT, EXOR, and MAJORITY gates are considered. Boolean functions for which such networks exist are defined to be fan-out free. The paper solves the following problems regarding the fan-out-free ...
  • A cellular array for multivalued logic functions 

    Kodandapani, K.L.; Setlur, R.V. (IEEE, 1978-11)
    An algebraic generalization of the well-known binary q-function array to a multivalued q-function array is presented. It is possible to associate tree-structure realizations for binary q-functions and multivalued q-functions. ...
  • Undetectability of bridging faults and validity of stuck-at fault test sets 

    Kodandapani, K.L.; Pradhan, D.K. (IEEE, 1980-01-01)
    The study of bridging faults (or short circuits that occur between conducting paths) has become increasingly important with the advent of LSI technology. To date, only a very few papers have been published on this topic. ...
  • The first stage in two-stage template matching 

    Li, Xiaobo; Dubes, Richard C. (IEEE, 1985-11)
    This paper formulates the problem encountered in the first stage of two-stage, binary template matching as a set of hypotheses to be tested, including a hypothesis of "no object." Two new statistics R and G are proposed, ...
  • Parallel algorithms for image template matching on hypercube SIMD computers 

    Fang, Zhixi; Li, Xiaobo; Ni, Lionel M. (IEEE, 1987-11)
    This correspondence presents several parallel algorithms for image template matching on an SIMD array processor with a hypercube interconnection network. For an N by N image and an M by M window, the time complexity is ...
  • The Nato software engineering conferences 

    Tomayko, J.E. (IEEE, 1989-05-15)
  • Categorization by reference: a novel approach to MeSH term assignment 

    Kouramajian, Vram; Devadhar, Vijayanth; Fowler, Jerry; Maram, Srinivas (American Medical Informatics Association, 1995)
    Categorization by Reference is a novel text classification technique that examines the existing classifications of the citations found in an as-yet unclassified text to determine what terms should be assigned to that text. ...
  • Collective adaptation: the exchange of coding segments 

    Haynes, Thomas (MIT Press, 1998)
    Coding segments are those subsegments of the chromosome that contribute positively to the fitness evaluation of the chromosome. Clique detection is a NP-complete problem in which we can detect such coding segments. We ...
  • An easy case of sorting by reversals 

    Tran, N. (Mary Ann Liebert, 1998)
    We show that a special case of sorting by reversals can be performed in polynomial time, namely, when the number of breakpoints is twice the distance.