This article describes an algorithm called HyperLex that is capable of automatically determining word uses in a textbase without recourse to a dictionary. The algorithm makes use ...
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
—In this paper, we present the results of a human computer interaction experiment that compared the performance of the animation of dynamic graphs to the presentation of small mu...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
Tammy Riklin Raviv, Vebjorn Ljosa, Annie L. Conery...
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...