𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bulk construction of dynamic clustered metric trees

✍ Scribed by Lior Aronovich; Israel Spiegler


Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
786 KB
Volume
22
Category
Article
ISSN
0219-1377

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A Structured Family of Clustering and Tr
✍ David Bryant; Vincent Berry πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 190 KB

A cluster A is an Apresjan cluster if every pair of objects within A is more similar than either is to any object outside A. The criterion is intuitive, compelling, but often too restrictive for applications in classification. We therefore explore extensions of Apresjan clustering to a family of rel

A dynamic lattice searching method with
✍ Xiaoli Yang; Wensheng Cai; Xueguang Shao πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 340 KB πŸ‘ 1 views

## Abstract A variation of the previous dynamic lattice searching (DLS) method, named as DLS with constructed core (DLSc), was proposed for structural optimization of Lennard‐Jones (LJ) clusters. In the new method, the starting random structure is generated with an icosahedron or a decahedron as a