Undiscovered relationships in a data set may confound analyses, particularly those that assume data independence. Such problems occur when characters used for phylogenetic analyse...
Anne M. Maglia, Jennifer L. Leopold, Venkat Ram Gh...
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Several computer vision problems, like segmentation, tracking and shape modeling, are increasingly being solved using level set methodologies. But the critical issues of stability...
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
Abstract. It is well known that pseudo-relevance feedback (PRF) improves the retrieval performance of Information Retrieval (IR) systems in general. However, a recent study by Cao ...