In this research, a systematic study is conducted of four dimension reduction techniques for the text clustering problem, using five benchmark data sets. Of the four methods -- Ind...
Bin Tang, Michael A. Shepherd, Malcolm I. Heywood,...
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For several dimensions it yields improved upper bounds including some new bounds on...
We show that given any polynomial ring R over a field and any ideal J R which is generated by three cubic forms, the projective dimension of R/J is at most 36. We also settle the...
Abstract. We introduce a new graph drawing convention for 3D hierarchical drawings of directed graphs. The vertex set is partitioned into layers of vertices drawn in parallel plane...
The exploration of multidimensional scalar fields is commonly based on the knowledge of the topology of their isosurfaces. The latter is established through the analysis of critic...