The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
Research has demonstrated that information workers often manage several different computing devices in an effort to balance convenience, mobility, input efficiency, and content rea...
Amy K. Karlson, Brian Meyers, Andy Jacobs, Paul Jo...
In this paper, we discuss how Artificial Intelligence (AI) techniques might be brought to bear in automatically recognizing “creative reasoning” in student e-discussions. An AI...
Bruce M. McLaren, Rupert Wegerif, Jan Miksatko, Ol...
This paper presents how ad-hoc co-located collaborations can be supported with an arbitrary number of users that only have acces to small-size mobile displays. Our approach is bas...
Abstract. Temporal question classification assigns time granularities to temporal questions ac-cording to their anticipated answers. It is very important for answer extraction and ...