Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    A Web adaptive educational system for people with hearing difficulties (2000)
    Springer
    Education and information technologies 5 (2000), S. 189-200 
    Details
    ISSN: 1573-7608
    Keywords: hearing difficulties ; sign language ; architecture ; interactive learning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Education
    Notes: Abstract In this paper we present a web adaptive educational tool for the Greek Sign Language. The design and the implementation of the tool were partially funded by national bodies. The paper presents the architecture of the tool, in an abstract way and briefly describes its functionality. The interaction process followed is also presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009606818900
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Maintaining order in a generalized linked list (1984)
    Springer
    Acta informatica 21 (1984), S. 101-112 
    Details
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary We give a representation for linked lists which allows to efficiently insert and delete objects in the list and to quickly determine the order of two list elements. The basic data structure, called an indexed BB [α]-tree, allows to do n insertions and deletions in O(n log n) steps and determine the order in constant time, assuming that the locations of the elements worked at are given. The improved algorithm does n insertions and deletions in O(n) steps and determines the order in constant time. An application of this provides an algorithm which determines the ancestor relationship of two given nodes in a dynamic tree structure of bounded degree in time O(1) and performs n arbitrary insertions and deletions at given positions in time O(n) using linear space.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00289142
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    The nearest common ancestor in a dynamic tree (1988)
    Springer
    Acta informatica 25 (1988), S. 37-54 
    Details
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary We consider the problem of determining the nearest common ancestor of two given nodes x and y (denoted by nca(x, y)) in a dynamic arbitrary tree T. We present an implementation of T by a pointer machine which needs linear space, performs m arbitrary insertions and deletions in the initially empty tree T in time O(m) and a query about nca(x, y) can be answered on-line in time O(log(min{depth(x), depth(y))+α(k,k))}, where the second factor is amortized over k queries, α is a functional inverse of Ackermann's function and depth(x) the distance from node x to the root of T.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00268844
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...