Search Constraints

Start Over
Filtering by: Date Created 2013 Remove constraint Date Created: 2013 Language English Remove constraint Language: English Resource Type Conference Proceeding Remove constraint Resource Type: Conference Proceeding

Search Results

  • Getting ready for RDA: a modular approach to training library staff

    Resource Type:
    Conference Proceeding
    Creator:
    Cross, Emma
    Abstract:
    Resource Description and Access is the new content standard coming Spring 2013, with national libraries using RDA effective March 30, 2013. Libraries need to address training for staff in all departments on how to interpret, catalogue and use RDA records.
    Date Created:
    2013-02-13

  • Timescapes: Putting history in your hip pocket

    Resource Type:
    Conference Proceeding
    Creator:
    Opp, James and Whitehead, Anthony D.
    Abstract:
    In this work we discuss our efforts to use the ubiquity of smart phone systems and the mobility they provide to stream historical information about your current place on the earth to the end user. We propose the concept of timescapes to portray this historical significance of where they are standing and allow a brief travel through time. By combining GPS location, with a rich media interpretation of existing historical documents, historical facts become an on-demand resource available to travellers, school children, historians and any interested 3rd party. To our knowledge this is the first introduction of the term timescape to be used in the context of historical information pull. Copyright
    Date Created:
    2013-09-05

  • The discrete voronoi game in a simple polygon

    Resource Type:
    Conference Proceeding
    Creator:
    Smid, Michiel, Maheshwari, Anil, Das, Sandip, and Banik, Aritra
    Abstract:
    Let P be a simple polygon with m vertices and let be a set of n points in P. We consider the points of to be users. We consider a game with two players and. In this game, places a point facility inside P, after which places another point facility inside P. We say that a user is served by its nearest facility, where distances are measured by the geodesic distance in P. The objective of each player is to maximize the number of users they serve. We show that for any given placement of a facility by, an optimal placement for can be computed in O(m + n(logn + logm)) time. We also provide a polynomial-time algorithm for computing an optimal placement for.
    Date Created:
    2013-10-08

  • Fréchet queries in geometric trees

    Resource Type:
    Conference Proceeding
    Creator:
    Smid, Michiel and Gudmundsson, Joachim
    Date Created:
    2013-09-24