Research Commons

Browsing Computing and Mathematical Sciences Papers by Title

Research Commons

Browsing Computing and Mathematical Sciences Papers by Title

Sort by: Order: Results:

  • Sánchez, J. Alfredo; Silva, Nabani N.; Twidale, Michael B.; Nichols, David M. (SPIE, 2005)
    This paper presents a qualitative and formative study of the uses of a starfield-based visualization interface for analysis of library collections. The evaluation process has produced feedback that suggests ways to ...
  • Nichols, David M.; Rose, John; Bainbridge, David; Witten, Ian H. (2010)
    Greenstone is a versatile open source multilingual digital library environment, emerging from research on text compression within the New Zealand Digital Library Research Project in the Department of Computer Science at ...
  • Vanschoren, Joaquin; Blockeel, Hendrik; Pfahringer, Bernhard; Holmes, Geoffrey (2012)
    Thousands of machine learning research papers contain extensive experimental comparisons. However, the details of those experiments are often lost after publication, making it impossible to reuse these experiments in further ...
  • Vanschoren, Joaquin; Blockeel, Hendrik; Pfahringer, Bernhard; Holmes, Geoffrey (2008)
    Many studies in machine learning try to investigate what makes an algorithm succeed or fail on certain datasets. However, the field is still evolving relatively quickly, and new algorithms, preprocessing methods, learning ...
  • Blockeel, Hendrik; Džeroski, Sašo; Kompare, Boris; Kramer, Stefan; Pfahringer, Bernhard; Van Laer, Wim (Taylor & Francis, 2004)
    This paper is concerned with the use of AI techniques in ecology. More specifically, we present a novel application of inductive logic programming (ILP) in the area of quantitative structure-activity relationships (QSARs). ...
  • Mayo, Michael; Frank, Eibe (2011)
    In this paper we empirically investigate the benefits of multi-view multi-instance (MVMI) learning for supervised image classification. In multi-instance learning, examples for learning contain bags of feature vectors and ...
  • Bell, Timothy C.; Thimbleby, Harold W.; Fellows, Mike; Witten, Ian H.; Koblitz, Neil; Powell, Matthew (Elsevier, 2003)
    Modern cryptography can achieve levels of security and authentication that non-specialists find literally incredible. Techniques including information-hiding protocols, zero-knowledge proofs and public key cryptosystems ...
  • Pfahringer, Bernhard; Anderson, Grant (Springer, Berlin, 2008)
    In this paper we investigate an approach to semi-supervised learning based on randomized propositionalization, which allows for applying standard propositional classification algorithms like support vector machines to ...
  • Milne, David N. (ACM, 2007)
    This paper describes ongoing research into obtaining and using knowledge bases to assist information retrieval. These structures are prohibitively expensive to obtain manually, yet automatic approaches have been researched ...
  • McKay, Dana; Hinze, Annika; Heese, Ralf; Vanderschantz, Nicholas; Timpany, Claire; Cunningham, Sally Jo (Springer-Verlag, 2012)
    Academic libraries have offered ebooks for some time, however little is known about how readers interact with them while making relevance decisions. In this paper we seek to address that gap by analyzing ebook transaction ...
  • Cunningham, Sally Jo; Nichols, David M. (2009)
    This paper builds an understanding how music is currently listened to by small (fewer than 10 individuals) to medium-sized (10 to 40 individuals) gatherings of people— how songs are chosen for playing, how the music fits ...
  • Twidale, Michael B.; Nichols, David M. (2005)
    The public nature of discussion in open source projects provides a valuable resource for understanding the mechanisms of open source software development. In this paper we explore how open source projects address issues ...
  • Milne, David N.; Witten, Ian H. (ACM, 2011)
    Anyone who has browsed Wikipedia has likely experienced the feeling of being happily lost, browsing from one interesting topic to the next and encountering information that they would never have searched for explicitly. ...
  • Kalnins, Ernie G.; Kress, Jonathan M.; Miller, W., Jr. (Institute of Physics, 2013)
    The quantum Kepler-Coulomb system in three dimensions is well known to be second order superintegrable, with a symmetry algebra that closes polynomially under commutators. This polynomial closure is also typical for second ...
  • Bainbridge, David; Osborn, Wendy; Witten, Ian H.; Nichols, David M. (Springer, 2006)
    We examine the problem of designing a generalized system for building institutional repositories. Widely used schemes such as DSpace are tailored to a particular set of requirements: fixed metadata set; standard view when ...
  • Milne, David N.; Witten, Ian H.; Nichols, David M. (2007)
    Thesauri are useful knowledge structures for assisting information retrieval. Yet their production is labor-intensive, and few domains have comprehensive thesauri that cover domain-specific concepts and contemporary usage. ...
  • Nevill-Manning, Craig G.; Reed, Todd; Witten, Ian H. (1997)
    We show how to extract plain text from PostScript files. A textual scan is inadequate because PostScript interpreters can generate characters on the page that do not appear in the source file. Furthermore, word and line ...
  • Apperley, Mark; Baker, Jay; Fletcher, Dale; Rogers, Bill (1999)
    Copy and paste, or cut and paste, using a clipboard or paste buffer has long been the principle facility provided to users for transferring data between and within GUI applications. We argue that this mechanism can be ...
  • Malik, Robi; Streader, David; Reeves, Steve (Springer, Berlin, 2004)
    This paper studies conflicts from a process-algebraic point of view and shows how they are related to the testing theory of fair testing. Conflicts have been introduced in the context of discrete event systems, where two ...
  • Kalnins, Ernie G.; Kress, Jonathan M. (IOP Publishing, 2010)
    We describe a method for determining a complete set of integrals for a classical Hamiltonian that separates in orthogonal subgroup coordinates. As examples, we use it to determine complete sets of integrals, polynomial in ...

Search Research Commons


Advanced Search

Browse

Theses

About Research Commons

My Account

Usage Statistics