616 search results - page 92 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
ICCAD
1997
IEEE
13 years 11 months ago
1997
IEEE
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...
ADC
2009
Springer
14 years 2 months ago
2009
Springer
In this work an R-tree variant, which uses minimum volume covering ellipsoids instead of usual minimum bounding rectangles, is presented. The most significant aspects, which dete...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
CIKM
2004
Springer
14 years 29 days ago
2004
Springer
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
IJCNN
2000
IEEE
13 years 12 months ago
2000
IEEE
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...