In this paper we will briefly describe the approaches taken by the Berkeley Cheshire Group for the GikiCLEF task of the QA track. Because the task was intended to model some aspec...
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Abstract Searching information resources using mobile devices is affected by displays on which only a small fraction of the set of ranked documents can be displayed. In this study ...
Vishwa Vinay, Ingemar J. Cox, Natasa Milic-Fraylin...
Abstract. A Video-on-Demand system usually consists of a large number of independent video servers. In order to utilize network resources as efficiently as possible the overall net...