Chancellery Research - Research Publications

Permanent URI for this collection

http://hdl.handle.net/11343/377

Filters

2006 - 2009 5
Reset filters

Settings
Statistics
Citations
Subject: Artificial Intelligence and Image Processing × Type: Journal Article ×

Search Results

Now showing 1 - 5 of 5
  • Item
    Thumbnail Image
    Entropy of the Retina Template
    Arakala, A ; Culpepper, JS ; Jeffers, J ; Turpin, A ; Boztas, S ; Horadam, KJ ; McKendrick, AM ; Tistarelli, M ; Nixon, MS (SPRINGER-VERLAG BERLIN, 2009)
  • Item
    Thumbnail Image
    Matilda: A visual tool for modeling with Bayesian networks
    Boneh, T ; Nicholson, AE ; Sonenberg, EA (WILEY, 2006-11)
  • Item
    Thumbnail Image
    Methodologies for evaluation of note-based music-retrieval systems
    Uitdenbogerd, AL ; Chattaraj, A ; Zobel, J (INFORMS, 2006-01-01)
    There have been many proposed music-retrieval systems, based on a variety of principles. How the effectiveness of these systems compares is not clear. The evaluation of some systems has been informal, without the rigor applied in other areas of information retrieval, and comparison of systems is difficult because of the lack of a common data set, queries, or relevance judgments. In this paper we explain how we collected artificial and expert music queries and name-based relevance judgments, and describe software we developed for collection of manual relevance judgments. Together with a collection of downloaded musical instrument digital interface (MIDI) files, these sets of queries and relevance judgments provide valuable tools for measuring music-retrieval systems. As an example of the value of these tools, we use them to compare the effect of using the expert queries and manual judgments to that of the artificial queries and manual judgments used in our earlier experiments.
  • Item
    Thumbnail Image
    A formal analysis of interest-based negotiation
    Rahwan, I ; Pasquier, P ; Sonenberg, L ; Dignum, F (SPRINGER, 2009-04)
  • Item
    Thumbnail Image
    A taxonomy of suffix array construction algorithms
    Publisi, SJ ; Smyth, WF ; Turpin, AH (ASSOC COMPUTING MACHINERY, 2007)
    In 1990, Manber and Myers proposed suffix arrays as a space-saving alternative to suffix trees and described the first algorithms for suffix array construction and use. Since that time, and especially in the last few years, suffix array construction algorithms have proliferated in bewildering abundance. This survey paper attempts to provide simple high-level descriptions of these numerous algorithms that highlight both their distinctive features and their commonalities, while avoiding as much as possible the complexities of implementation details. New hybrid algorithms are also described. We provide comparisons of the algorithms' worst-case time complexity and use of additional space, together with results of recent experimental test runs on many of their implementations.