We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to han...
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
Given a single image of an arbitrary road, that may not be well-paved, or have clearly delineated edges, or some a priori known color or texture distribution, is it possible for a ...
We present an argument-based qualitative decision-making framework in which the social values promoted or demoted by alternative action-options are explicitly represented. We show...
Trevor J. M. Bench-Capon, Katie Atkinson, Peter Mc...
We propose a companion solution to iSCSI that is more suited for virtualization of local computer bus architectures, such as PCI/PCI-X and PCI Express. We explore the architecture ...