Search Constraints

Start Over
Filtering by: Alternative title ssim FG 23 Remove constraint Alternative title ssim: FG 23 Academic Affiliation Computer Science Remove constraint Academic Affiliation: Computer Science

Search Results

  • Image thinning by hexagonal grid

    Creator:
    Carstens, Brian
    Abstract:
    One of the tasks of image processing systems is to characterize images by thinning, or skeletonizing techniques. The standard method, based on a disk growing technique, often results in disconnected skeletons. Since the standard technique is based on a square grid system, the disk shape is also square. The. purpose...
    Resource Type:
    Capstone Project
    Full Text:
    , 0.3666, /* 23 */ .5666, 0.4333, /* 24 */ .5000, 0. 5000 I* 25 */ ); /* read in square cell data

  • A survey of divide and conquer algorithms for polygon fillings

    Creator:
    Mossaides, Paula Xenis
    Abstract:
    This survey looks at five different polygon breaking algorithms and compares them. The criteria for comparison are: 1. Complexity of the algorithm. 2. The number and type of subpolygons produced. 3. The classes of input polygons that can be broken. The best algorithm is then coded and a comparison is...
    Resource Type:
    Capstone Project
    Full Text:
    18 Figure 19 Figure 20 Figure 21 Figure 22 Figure 23 Figure 24 Figure 25 Figure 26 Figure

  • An integrated testing and fault localization methodology for spreadsheet languages

    Creator:
    Reichwein, James
    Abstract:
    Spreadsheet languages, which include commercial spreadsheets and various research systems, have proven to be flexible tools in many settings. Research shows, however, that spreadsheets often contain faults. This thesis presents an integrated testing and fault localization methodology for spreadsheets. This methodology allows spreadsheet developers to engage in modeless development, testing...
    Resource Type:
    Masters Thesis
    Full Text:
    16 3.4 Estimating Fault Likelihood 18 3.5 Example . . . . . . . . . . . 23 3.5.1 Marking Cells

  • Optimal inference with local expressions

    Creator:
    Borujerdi, Mohammad
    Abstract:
    Probabilistic inference using Bayesian networks is now a well-established approach for reasoning under uncertainty. Among many e ciency-driven tech- niques which have been developed, the Optimal Factoring Problem (OFP) is distinguished for presenting a combinatorial optimization point of view on the problem. The contribution of this thesis is to extend...
    Resource Type:
    Dissertation
    Full Text:
    Local Expressions 23 4.1 Canonical Form . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 4.2

  • Controlled potential coulometry digital prediction of endpoints

    Creator:
    Grimes, Greg
    Abstract:
    In 19589 J. J. Lingane published an article describing the behavior of an electrolysis using controlled potential coulometry. A typical titration was an hour or more, limiting the variety of applications of the technique. Stephens, Jakob, Rigdon and Harrar looked into the many procedures that have been proposed to locate...
    Resource Type:
    Research Paper
    Full Text:
    . Meites ands. A. Moros, Anal Chem, Vol. 31, No. 23, 1959. I>, ~:'.,.:v APPENDIX A The listings of

  • A fast algorithm for determining the primitivity of an n x n nonnegative matrix

    Creator:
    Leegard, Amanda D.
    Abstract:
    Nonnegative matrices have a myriad of applications in the biological, social, and physical genres. Of particular importance are the primitive matrices. A nonnegative matrix, M, is primitive exactly when there is a positive integer, k, such that M[superscript k] has only positive entries; that is, all the entries in M[superscript...
    Resource Type:
    Masters Thesis
    Full Text:
    .............................................................................. 14 2.5 Forward breadth-first search pseudo-code with runtimes ............... 23 3.1 Breakdown of

  • PS-E : a production system environment

    Creator:
    Blanchard, Bruno and Bregar, William S.
    Abstract:
    Production Systems are languages widely used for the implementation of Artificial Intelligence projects. They support programs in which the sequence of instructions is not fully determined at the beginning of their execution, as well as 'event driven' programs (i.e. the occurrence of a particular element in the data set determines...
    Resource Type:
    Technical Report
    Full Text:
    23 24 25 26 27 27 27 29 31 31 33 36 38 Appendix Appendix 2 Appendix 3 How to

  • Intercom : a development tool for multicomputer-targeted Dataparallel C programs

    Creator:
    McCallum, Darcy
    Resource Type:
    Capstone Project
    Full Text:
    useful: -display -fg ~bg -g // display for application // color for application foreground

  • Minimal perfect hash tables environments

    Creator:
    Pin-Ngern, Ouen
    Abstract:
    Cichelli gave a simple machine independent minimal perfect hashing function for small static sets. The hash function value for a word is computed as the sum of the length of the word and the values associated with the first and last letters of the word. Cichelli's algorithm (word-oriented) to find...
    Resource Type:
    Conference Proceeding
    Full Text:
    10 21 DAGGAIGAJC 10 22 HEBEHFBFJH 10 23 FABEFFEBHI 10 24 BEHEHFBHJF 10 25 EBCDDFEFEJ 10

  • Learning hierarchical decomposition rules for planning : an inductive logic programming approach

    Creator:
    Reddy, Chandrasekhara K.
    Abstract:
    Artificial Intelligence (AI) planning techniques have been central to automating a gamut of tasks from the mundane route planning and beer production to the ethereal image processing of space-ship images. Of all the planning techniques, hierarchical- decomposition planning has been the technique most employed in industrial-strength planners. Hierarchical-decomposition planning is...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 3.2 D-rules to Horn Clauses . . . . . . . . . . . . . . . . . . . . . . . . . 23 3.3 HTNs to