Computer Science
Browse by
Recent Submissions

Categorization by reference: a novel approach to MeSH term assignment
(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 asyet unclassified text to determine what terms should be assigned to that text. ... 
An easy case of sorting by reversals
(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. 
Collective adaptation: the exchange of coding segments
(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 NPcomplete problem in which we can detect such coding segments. We ... 
Parallel algorithms for image template matching on hypercube SIMD computers
(IEEE, 198711)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 ... 
Custom programming/analysis in the small business environment
(IEEE, 197609)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. ... 
The Nato software engineering conferences
(IEEE, 19890515) 
The first stage in twostage template matching
(IEEE, 198511)This paper formulates the problem encountered in the first stage of twostage, 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, ... 
A cellular array for multivalued logic functions
(IEEE, 197811)An algebraic generalization of the wellknown binary qfunction array to a multivalued qfunction array is presented. It is possible to associate treestructure realizations for binary qfunctions and multivalued qfunctions. ... 
On combinational networks with restricted fanout
(IEEE, 197804)Fanoutfree networks of AND, OR, NOT, EXOR, and MAJORITY gates are considered. Boolean functions for which such networks exist are defined to be fanout free. The paper solves the following problems regarding the fanoutfree ... 
Undetectability of bridging faults and validity of stuckat fault test sets
(IEEE, 19800101)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. ... 
Flexible autonomous robotic task scheduling using advanced RISC machines
(Wichita State University, 200808)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 ...