Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is useful for many applications in the Semantic W...
Nick Bassiliades, Efstratios Kontopoulos, Grigoris...
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Growing complexity of the data and processes to be managed, as well as the transition from strict governmental regulation towards autonomy make academic institutions a significant ...
Abstract Baharak Rastegari and Anne Condon Department of Computer Science, University of British Columbia Abstract. Accurate prediction of pseudoknotted RNA secondary structure is ...