Research Commons

Browsing Computing and Mathematical Sciences by Title

Research Commons

Browsing Computing and Mathematical Sciences by Title

Sort by: Order: Results:

  • Pfahringer, Bernhard (2002)
    When considering the merit of data mining challenges, we need to answer the question of whether the amount of academic outcome justifies the related expense of scarce research time. In this paper I will provide anecdotal ...
  • Frank, Eibe; Hall, Mark A.; Trigg, Leonard E.; Holmes, Geoffrey; Witten, Ian H. (Oxford University Press., 2004)
    The Weka machine learning workbench provides a general purpose environment for automatic classification, regression, clustering and feature selection-common data mining problems in bioinformatics research. It contains an ...
  • Helma, Christoph; Kramer, Stefan; Pfahringer, Bernhard; Gottmann, Eva (Environmental health perspectives, 2000)
    Every technique for toxicity prediction and for the detection of structure–activity relationships relies on the accurate estimation and representation of chemical and toxicologic properties. In this paper we discuss the ...
  • Utting, Mark (2001)
    This paper describes some of the difficulties and challenges that arise during the design of tools for validating Z specifications by testing and animation. We address three issues: handling undefined terms, simplification ...
  • Phan, Thong H.; Witten, Ian H. (1994)
    This paper presents the method of data transformation for discovering numeric functions from their examples. Based on the idea of transformations between functions, this method can be viewed as a semantic counterpart to ...
  • Schweppe, Heinz; Hinze, Annika; Faensen, Daniel (Springer, Berlin, 2000)
    Database systems have been traditionally used as integration tools. Data integration was the primary goal of first generation systems. After relational technology had become a mature base for application development, new ...
  • Cleary, John G.; Utting, Mark; Clayton, Roger (University of Waikato, Department of Computer Science, 2010)
    The increasing available parallelism of computers demands new programming languages that make parallel programming dramatically easier and less error prone. It is proposed that datalog with negation and timestamps is a ...
  • Cunningham, Sally Jo (1996)
    As the field of machine learning (ML) matures, two types of data archives are developing: collections of benchmark data sets used to test the performance of new algorithms, and data stores to which machine learning/data ...
  • Nichols, David M.; Pemberton, Duncan; Dulhoumi, Salah; Larouk, Omar; Belisle, Claire; Twidale, Michael B. (Springer, Berlin, 2000)
    Interfaces to library systems have largely failed to represent the in-herently collaborative nature of information work. This paper describes how collaborative functionality is being implemented as part of the DEBORA project ...
  • Hall, Mark A. (2006)
    The naive Bayes classifier continues to be a popular learning algorithm for data mining applications due to its simplicity and linear run-time. Many enhancements to the basic algorithm have been proposed to help mitigate ...
  • Smith, Benjamin R.; Cavenagh, Nicholas J. (Wiley, 2010)
    In this article we find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both even and short relative to the number of parts.
  • Smith, Benjamin R.; Cavenagh, Nicholas J. (2010)
    In this paper we examine the problem of decomposing the lexicographic product of a cycle with an empty graph into cycles of uniform length. We determine necessary and sufficient conditions for a solution to this problem ...
  • Billington, Elizabeth J.; Cavenagh, Nicholas J. (Springer, 2011)
    The problem of finding necessary and sufficient conditions to decompose a complete tripartite graph into 5-cycles was first posed at a conference in 1994 (Mahmoodian and Mirzakhani in Combinatorics Advances, 1995). Since ...
  • Masoodian, Masood; McKoy, Sam; Rogers, Bill; Ware, David (University of Waikato, Department of Computer Science, 2004)
    The most commonly used view in word processing software shows only the paragraphs of text immediately adjacent to the cursor position. Generally this is appropriate, for example when composing a single paragraph. However, ...
  • Cavenagh, Nicholas J. (2013)
    If D is a partially filled-in (0, 1)-matrix with a unique completion to a (0, 1)-matrix M (with prescribed row and column sums), we say that D is a defining set for M. If the removal of any entry of D destroys this property ...
  • Apperley, Mark; Keegan, Te Taka Adrian Gregory; Cunningham, Sally Jo; Witten, Ian H. (Auckland University Press, Auckland, New Zealand, 2002)
    Although any collection of historical newspapers provides a particularly rich and valuable record of events and social and political commentary, the content tends to be difficult to access and extremely time-consuming to ...
  • Bittner, Sven; Hinze, Annika (2004)
    Event Notification Services (ENS) use the publish/subscribe paradigm to continuously inform subscribers about events they are interested in. Subscribers define their interest in so-called profiles. The event information ...
  • Kozuka, Takanori; Hinze, Annika (2005)
    This report describes our project that addresses the challenge of changes in the semantic web. Some studies have already been done for the so-called adaptive semantic web, such as applying inferring rules. In this study, ...
  • Cockburn, Andy; Jones, Steve (1997)
    The World Wide Web (WWW) is a successful hypermedia information space used by millions of people, yet it suffers from many deficiencies and problems in support for navigation around its vast information space. In this paper ...
  • Pearson, Murray W.; Armstrong, Dean Andrew; McGregor, Anthony James (IEEE, 2002)
    Teaching computer systems, including computer architecture, assembly language programming and operating system implementation, is a challenging occupation. At the University of Waikato this is made doubly true because we ...

Search Research Commons


Advanced Search

Browse

Theses

About Research Commons

My Account

Usage Statistics