To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...
In this paper we explore the use of category information for ad hoc retrieval in Wikipedia. We show that techniques for entity ranking exploiting this category information can als...
With quick evolution of grid technologies and increasing complexity of e-Science applications, reasoning temporal properties of grid workflows to ensure reliability and trustworth...
This paper describes a heart attack self-test application for a mobile phone which allows potential victims of a heart attack to quickly assess whether they are having a heart att...
—We consider the design of a network in which packet transmissions between two nodes are to be guaranteed a certain probability of success. There are N independent paths between ...