What does INF stand for?

Infimum (greatest lower bound)

This definition appears very rarely and is found in the following Acronym Finder categories:

Science, medicine, engineering, etc.

Other Resources:

<< Previous	Abbreviation Database Surfer		Next >>
Integrated Electronic Warfare System (USAF) Integrated Electronic Warfare System/Integrated Communication/Navigation/Avionics Integrated Electronic Warfare System Simulation Initiative for the Evaluation of XML Retrieval Integrated Numerical Experiment International Nuclear Emergency Exercise (Nuclear Energy Agency) If-Then-Else Normal Form Industry Negative File Infantry Infiltration		Infinitive (linguistics) Infinity Information (File Name Extension) Inland Navigation Facility Interface Interference Interferon Intermediate-Range Nuclear Forces International Naturist Federation International Nepal Fellowship (est. 1952)

Samples in periodicals archive:

Meet and join are computed as supremum and infimum, respectively.

B](f)(x) = [disconjunction] {f(x - y),-y [member of] B(x)}, (4) where [disconjunction] if the supremum (or maximum) operator and [conjunction] the infimum (minimum) operator and B(x) is the structuring element centered at point x.

A simple methodology to segment X-ray tomographic images of a ...

2])), where the infimum is over all isometric embeddings [[psi].

The continuous limit of large random planar maps

The metric-based gradient is a vectorial gradient defined as the difference between the supremum and the infimum of a defined distance on a unit neighbourhood B(x): [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (5) Various metric distances are available for this gradient such as: * Euclidean distance: [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (6) * Mahalanobis distance: [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (7) where [SIGMA] is the covariance matrix between variables (channels) of [f.

Morphological segmentation of hyperspectral images

Taking the infimum over [lambda] [member of] K in (?

A survey on inequalities for hermitian forms

In other words, h reaches its infimum where the function g([Rho]) [equivalent to] h(b = [[Rho].

Learning in sequential auctions

2] is given by [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] It is well known that the total variation distance satisfies [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] where the infimum is over all couplings [pi] = L(X, Y) of S'-valued random variables X, Y such that the marginals are L(X) = [[mu].

Concentration of measure and mixing for Markov chains