Now showing items 21-40 of 275

  • Boosting trees for cost-sensitive classifications

    Ting, Kai Ming; Zheng, Zijian (University of Waikato, Department of Computer Science, 1998-01)
    This paper explores two boosting techniques for cost-sensitive tree classification in the situation where misclassification costs change very often. Ideally, one would like to have only one induction, and use the induced ...
  • Browsing and book selection in the physical library shelves

    Cunningham, Sally Jo; Alqurashi, Hayat; Hinze, Annika; Vanderschantz, Nicholas; Timpany, Claire; Heese, Ralf (University of Waikato, Department of Computer Science, 2013-02)
    Library users should be conveniently interact with collections and be able to easily choose books of interest as they explore and browse a physical book collection. While there exists a growing body of naturalistic studies ...
  • Browsing in digital libraries: a phrase-based approach

    Nevill-Manning, Craig G.; Witten, Ian H.; Paynter, Gordon W. (1997-01)
    A key question for digital libraries is this: how should one go about becoming familiar with a digital collection, as opposed to a physical one? Digital collections generally present an appearance which is extremely opaque-a ...
  • Browsing tree structures

    Apperley, Mark; Spence, Robert; Hodge, Stephen; Chester, Michael (Computer Science, University of Waikato, 1999-05)
    Graphic representations of tree structures are notoriously difficult to create, display, and interpret, particularly when the volume of information they contain, and hence the number of nodes, is large. The problem of ...
  • Building a public digital library based on full-text retrieval

    Witten, Ian H.; Nevill-Manning, Craig G.; Cunningham, Sally Jo (University of Waikato, Department of Computer Science, 1995-08)
    Digital libraries are expensive to create and maintain, and generally restricted to a particular corporation or group of paying subscribers. While many indexes to the World Wide Web are freely available, the quality of ...
  • A calculator for supporting derivation in constructive type-theory: PICTCalc

    Reeves, Steve (1994-06)
    PICTCalc is an interactive program written in LPA Prolog which has encoded within it the rules of Martin-Löf's constructive type theory (CTT), a formal system based on the constructive or intuitionistic mathematics of ...
  • Catching and displaying memory cues for a mobile augmented memory system

    Bellamy, Jake; Hinze, Annika (University of Waikato, Department of Computer Science, 2013-12)
    This report goes over and details the progress of the 2013 COMP477 project “Augmenting Memory: The Digital Parrot on Mobile Devices” undertaken by Jake Bellamy and supervised by Annika Hinze at the University of Waikato. The ...
  • Character-less programming

    Hopper, Keith; Barbour, Robert H. (1994-02)
    This paper proposes a mechanism for the definition and implementation of programming languages. Culturally-dependent aspects of the definition, such as the language and character set, can be separated from the process of ...
  • Character-less programming II: the spreadsheet

    Barbour, Robert H. (University of Waikato, Department of Computer Science, 1995-11)
    The spreadsheet is a commonly used, yet under-researched, application tool. Hendry and Green (1994) report fewer than ten entries about spreadsheets in the HCI community literature between 1984 and 1991. The 1993 Human ...
  • Chinks in the armor of public key cryptosystems

    Wilson, William J. (1994-03)
    Potential weaknesses in public key cryptosystem design and use are identified with emphasis on a particular vulnerability resulting from the encryption of ordinary natural language plaintext. This weakness occurs when an ...
  • Classification and regression algorithms for WEKA implemented in Python

    Beckham, Christopher J. (University of Waikato, Department of Computer Science, 2015-10)
    WEKA is a popular machine learning workbench written in Java that allows users to easily classify, process, and explore data. There are many ways WEKA can be used: through the WEKA Explorer, users can visualise data, train ...
  • Clustering with finite data from semi-parametric mixture distributions

    Wang, Yong; Witten, Ian H. (Dept. of Computer Science, University of Waikato, 1999-11)
    Existing clustering methods for the semi-parametric mixture distribution perform well as the volume of data increases. However, they all suffer from a serious drawback in finite-data situations: small outlying groups of ...
  • Collaborative, integrated software development with multiple views

    Grundy, John C.; Hosking, John G.; Mugridge, Warwick B.; Armor, Robert W. (1994-05)
    This paper presents a new model for supporting collaborative, integrated software development utilising multiple textual and graphical views. Views can be asynchronously edited by different developers using separate versions. ...
  • A comparative transaction log analysis of two computing collections

    Mahoui, Malika; Cunningham, Sally Jo (University of Waikato, Department of Computer Science, 2000-07)
    Transaction logs are invaluable sources of fine-grained information about users’ search behavior. This paper compares the searching behavior of users across two WWW-accessible digital libraries: the New Zealand Digital ...
  • Comparing human and computational models of music prediction

    Witten, Ian H.; Manzara, Leonard C.; Conklin, Derrell (Department of Computer Science, University of Waikato, 1992)
    The information content of each successive note in a piece of music is not an intrinsic musical property but depends on the listener's own model of a genre of music. Human listeners' models can be elicited by having them ...
  • Comparison of data and process refinement

    Reeves, Steve; Streader, David (University of Waikato, Department of Computer Science, 2003-05)
    When is it reasonable, or possible, to refine a one place buffer into a two place buffer? In order to answer this question we characterise refinement based on substitution in restricted contexts. We see that data refinement ...
  • Compositional nonblocking verification with always enabled and selfloop-only events

    Pilbrow, Colin (University of Waikato, Department of Computer Science, 2013-11-19)
    This report proposes to improve compositional nonblocking verification through the use of two special event types: always enabled and selfloop-only events. Compositional verification involves abstraction to simplify parts ...
  • Compositional supervisor synthesis with state merging and transition removal

    Mohajerani, Sahar; Malik, Robi; Fabian, Martin (Department of Computer Science, The University of Waikato, 2016)
    This working paper proposes a framework to obtain memory-efficient supervisors for large discrete event systems, which are least restrictive, controllable, and nonblocking. The approach combines compositional synthesis and ...
  • Compositional synthesis of discrete event systems via synthesis equivalence

    Malik, Robi; Flordal, Hugo (Department of Computer Science, University of Waikato, 2008-05-12)
    A two-pass algorithm for compositional synthesis of modular supervisors for largescale systems of composed finite-state automata is proposed. The first pass provides an efficient method to determine whether a supervisory ...
  • Compressing computer programs

    Davies, Rod M.; Witten, Ian H. (Department of Computer Science, University of Waikato, 1993)
    This paper describes a scheme for compressing programs written in a particular programming language—which can be any language that has a formal lexical and syntactic description—in such a way that they can be reproduced ...