Browsing Computer Science by Title

Now showing items 6-11 of 11

    • 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, ...

    • Flexible autonomous robotic task scheduling using advanced RISC machines 

      Zaccagni, Zachary James (Wichita State University, 2008-08)
      This research presents two methods for a group of Garcia robots to collaboratively decide which task to attend to, and to move to their respective locations. One method allows for a needed flexibility and dynamic analysis ...

    • The Nato software engineering conferences 

      Tomayko, J.E. (IEEE, 1989-05-15)

    • 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 ...

    • 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 ...

    • 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. ...