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 (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
Adel Dayarian, Todd P. Michael, Anirvan M. Sengupt...
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
—Designers of TCAMs (ternary CAMs) for packet classification often have to deal with unpredictable sets of rules. These result in highly variable rule expansions, and can only r...
Nowadays, capturing the knowledge in ontological structures is one of the primary focuses of the semantic web research. To exploit the knowledge from the vast quantity of existing ...
Michal Laclavik, Marek Ciglan, Martin Seleng, Ladi...