Sciweavers

173 search results - page 3 / 35
» k-Sets in Four Dimensions
Sort
View
AI
2005
Springer
13 years 11 months ago
Comparing Dimension Reduction Techniques for Document Clustering
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,...
JCT
2007
134views more  JCT 2007»
13 years 6 months ago
Improved Delsarte bounds for spherical codes in small dimensions
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...
Florian Pfender
JSC
2010
63views more  JSC 2010»
13 years 1 months ago
A bound on the projective dimension of three cubics
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...
Bahman Engheta
GD
2005
Springer
13 years 11 months ago
Hierarchical Layouts of Directed Graphs in Three Dimensions
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...
Seok-Hee Hong, Nikola S. Nikolov
VDA
2010
166views Visualization» more  VDA 2010»
13 years 4 months ago
Critical region analysis of scalar fields in arbitrary dimensions
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...
Madjid Allili, Marc Ethier, Tomasz Kaczynski