In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
A major issue in evaluating speech enhancement and hearing compensation algorithms is to come up with a suitable metric that predicts intelligibility as judged by a human listener...
Jeff Bondy, Ian C. Bruce, Suzanna Becker, Simon Ha...
The probabilistic relation between verbs and their arguments plays an important role in modern statistical parsers and supertaggers, and in psychological theories of language proc...
There has been an explosion of interest in Knowledge Management [KM] theory and practice. However, it is argued here that much of this work fails to consider the purpose for which...
Traditional benchmarking methods for information retrieval (IR) are based on experimental performance evaluation. Although the metrics precision and recall can measure the perform...
Dawei Song, Kam-Fai Wong, Peter Bruza, Chun Hung C...