Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Background: High throughput sequencing has become an increasingly important tool for biological research. However, the existing software systems for managing and processing these ...
David B. Burdick, Christopher C. Cavnor, Jeremy Ha...
We present an algorithm that restructures the state transition graph STG of a sequential circuit so as to reduce power dissipation. The STG is modi ed without changing the behav...
This paper presents a novel dimension reduction algorithm for kernel based classification. In the feature space, the proposed algorithm maximizes the ratio of the squared between-c...
Senjian An, Wanquan Liu, Svetha Venkatesh, Ronny T...
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...