✦ LIBER ✦

An adaptive algorithm for finding a covering hypersphere

✍ Scribed by S.J. Wan; S.K.M. Wong

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 472 KB
Volume: 33
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90179-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An adaptive algorithm for fitting with s

An adaptive algorithm for fitting with splines

✍ T. M. Tao; A. T. Watson 📂 Article 📅 1988 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 411 KB 👁 1 views

An algorithm for finding factorizations

An algorithm for finding factorizations of complete graphs

✍ A. J. W. Hilton; Matthew Johnson 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 1 views

## Abstract We show how to find a decomposition of the edge set of the complete graph into regular factors where the degree and edge‐connectivity of each factor is prescribed. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 132–136, 2003

An Alternative Algorithm for Adaptive Hi

An Alternative Algorithm for Adaptive Histogram Equalization

✍ J.A. Stark; W.J. Fitzgerald 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 364 KB

only have one example from the ensemble, it is necessary to estimate the histogram at each point from surrounding Adaptive histogram equalization has become well-established as a technique for enhancing contrast in images. This paper pixel GLs. In windowed adaptive HE this is done by calcuinvestiga

An adaptive time-stepping algorithm for

An adaptive time-stepping algorithm for quasistatic processes

✍ van den Boogaard, A. H. ;De Borst, R. ;van den Bogert, P. A. J. 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 375 KB 👁 1 views

An Algorithm for Finding the Causal Dist

An Algorithm for Finding the Causal Distributed Breakpoint

✍ Toshimitsu Masuzawa; Nobuki Tokura 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 137 KB

An Algorithm for finding optimum path in

An Algorithm for finding optimum path in networks

✍ Kabekode V.S. Bhat 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 242 KB

In this paper we present an O((V( . loglV() algorithm forfinding an optimum path between two nodes in an edge-sparse network using a new approach. The method exploits the data structure and a simple breadth-first search process.