✦ LIBER ✦

The Index of a Point Lattice in a Set

✍ Scribed by B. Uhrin

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 424 KB
Volume: 54
Category: Article
ISSN: 0022-314X
DOI: 10.1006/jnth.1995.1115

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dynamic interaction index based on set

A dynamic interaction index based on set point transmittance

✍ B. W. Bequette; T. F. Edgar 📂 Article 📅 1988 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 274 KB

Most chemical processes are multivariable in nature, that is, the!y are characterized by multiple inputs (manipulated variables) and multiple outputs (controlled variables). A number of investigators have developed measures of interaction that allow a control system designer to determine (I priori t

A simple estimate of the polymer theta-p

A simple estimate of the polymer theta-point on different lattices

✍ Barat, Krishna 📂 Article 📅 1993 🏛 Wiley (John Wiley & Sons) ⚖ 274 KB

## Abstract We check here numerically and establish the validity of a simple estimate for the polymer theta‐point on various pure and diluted lattices. Our study on two‐dimensional lattices supports a linear relationship of the θ‐point value with the average number __Z__~eff~ of non‐bonded (nearest

The r-cubical Lattice and a Generalizati

The r-cubical Lattice and a Generalization of the cd-index

✍ Richard Ehrenborg; Margaret Readdy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 390 KB

In this paper we generalize the cd -index of the cubical lattice to an r -cd -index , which we denote by Õ ( r ) . The coef ficients of Õ ( r ) enumerate augmented Andre ´ r -signed permutations , a generalization of Purtill's work relating the cd -index of the cubical lattice and signed Andre ´ per

The Bordered Operator and the Index, of

The Bordered Operator and the Index, of a Constrained Critical Point

✍ Leon Greenberg; John H. Maddocks; Kathleen A. Hoffman 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

Is There a Circle that Passes Through a

Is There a Circle that Passes Through a Given Number of Lattice Points?

✍ H. Maehara; M. Matsumoto 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 45 KB

Efficiently Approximating the Minimum-Vo

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions

✍ Gill Barequet; Sariel Har-Peled 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We present an efficient O n + 1/ε 4 5 -time algorithm for computing a 1 + ε)approximation of the minimum-volume bounding box of n points in 3 . We also present a simpler algorithm whose running time is O n log n + n/ε 3 . We give some experimental results with implementations of various variants of