✦ LIBER ✦

A computationally efficient technique for data-clustering

✍ Scribed by M. Narasimha Murty; G. Krishna

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 373 KB
Volume: 12
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(80)90039-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A computationally efficient technique fo

A computationally efficient technique for state estimation of nonlinear systems

✍ Jastej S. Dhingra; Richard L. Moose; Hugh Vanlandingham; Thomas A. Lauzon 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 399 KB

A directional clustering technique for r

A directional clustering technique for random data classification

✍ Carlos Reyes; Malek Adjouadi 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

This paper introduces a new clustering technique for random data classification based on an enhanced version of the Voronoi diagram. This technique is optimized to deal in the best way possible with data distributions which in their spatial representations experience overlap. A mathematical framewor

A computationally efficient technique fo

A computationally efficient technique for the solution of non-isothermal nylon-6 polymerization in batch reactors

✍ Sanjay Nandrajog; P. Vimala; Santosh K. Gupta; Anil Kumar 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 639 KB

## Abstract The kinetic scheme of nylon‐6 polymerization consists of ring opening, polyaddition, step growth, reaction with monofunctional acids and cyclization. A set of ordinary differential equations (initial value problem) governing the concentrations and moments of the reacting species and the

A color clustering technique for image s

A color clustering technique for image segmentation

✍ Mehmet Celenk 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 93 KB

A color clustering technique for image s

A color clustering technique for image segmentation

✍ Mehmet Celenk 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 94 KB

A computationally efficient method for n

A computationally efficient method for nonlinear multicommodity network flow problems

✍ Lin, Shin-Yeu; Lin, Ch'i-Hsin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB 👁 2 views

In this paper, we present a new method for solving nonlinear multicommodity network flow problems with convex objective functions. This method combines a well-known projected Jacobi method and a new dual projected pseudo-quasi-Newton (DPPQN) method which solves multicommodity flow quadratic subprobl