139 search results - page 16 / 28 » Introduction to Testing Graph Properties |
CSL
2004
Springer
13 years 8 months ago
2004
Springer
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 ...
TIP
2010
13 years 7 months ago
2010
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
TVCG
2011
13 years 3 months ago
2011
—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...
MICCAI
2010
Springer
13 years 7 months ago
2010
Springer
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...
IJCV
2006
13 years 8 months ago
2006
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...