Results 1 - 10 of 27,254

Interactive Order-Independent Transparency

by Cass Everitt , 2001
"... this document is to enable OpenGL developers to implement this technique with NVIDIA OpenGL extensions and GeForce3 hardware. Since shadow mapping is integral to the technique a very basic introduction is provided, but the interested reader is encouraged to explore the referenced material for more d ..."
Abstract - Cited by 134 (0 self) - Add to MetaCart
this document is to enable OpenGL developers to implement this technique with NVIDIA OpenGL extensions and GeForce3 hardware. Since shadow mapping is integral to the technique a very basic introduction is provided, but the interested reader is encouraged to explore the referenced material for more detail

Direct Proofs of Order Independence

by Krzysztof R Apt - Economics Bulletin , 2011
"... Abstract We establish a generic result concerning order independence of a dominance relation on finite games. It allows us to draw conclusions about order independence of various dominance relations in a direct and simple way. ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract We establish a generic result concerning order independence of a dominance relation on finite games. It allows us to draw conclusions about order independence of various dominance relations in a direct and simple way.

Order-independent texture synthesis

by Li-yi Wei, Marc Levoy , 2002
"... Search-based texture synthesis algorithms are sensitive to the order in which texture samples are generated; different synthesis orders yield different textures. Unfortunately, most polygon rasterizers and ray tracers do not guarantee the order with which surfaces are sampled. To circumvent this pro ..."
Abstract - Cited by 75 (7 self) - Add to MetaCart
Search-based texture synthesis algorithms are sensitive to the order in which texture samples are generated; different synthesis orders yield different textures. Unfortunately, most polygon rasterizers and ray tracers do not guarantee the order with which surfaces are sampled. To circumvent

Order Independence and Rationalizability

by Krzysztof R. Apt , 2005
"... Two natural strategy elimination procedures have been studied for strategic games. The first one involves the notion of (strict, weak, etc) dominance and the second the notion of rationalizability. In the case of dominance the criterion of order independence allowed us to clarify which notions and u ..."
Abstract - Cited by 10 (4 self) - Add to MetaCart
Two natural strategy elimination procedures have been studied for strategic games. The first one involves the notion of (strict, weak, etc) dominance and the second the notion of rationalizability. In the case of dominance the criterion of order independence allowed us to clarify which notions

Order Independent Loss Networks

by Sa Berezner, AE Krzesinski
"... . The Order Independent (OI) queues are a class of quasi-reversible queues where the total departure rate from any queue state is independent of the order of the customers in the queue. The OI class is extended to include networks of queues which can be used to model systems with complex loss mechan ..."
Abstract - Add to MetaCart
. The Order Independent (OI) queues are a class of quasi-reversible queues where the total departure rate from any queue state is independent of the order of the customers in the queue. The OI class is extended to include networks of queues which can be used to model systems with complex loss

On Order–Independent Sequential Thinning

by Péter Kardos, Kálmán Palágyi
"... Abstract—The visual world composed by the human and computational cognitive systems strongly relies on shapes of objects. Skeleton is a widely applied shape feature that plays an important role in many fields of image processing, pattern recognition, and computer vision. Thinning is a frequently use ..."
Abstract - Add to MetaCart
different skeletons. In this work, we give a survey of our results on order-independent thinning: we introduce some sequential algorithms that produce identical skeletons for any visiting orders, and we also present some sufficient conditions for the order-independence of templatebased sequential algorithms.

Order Independent Individual Rationality

by Laurent Lamy , 2006
"... We consider the implementation of an economic outcome under complete information when the principal cannot commit to a simul-taneous participation game. From a class of sequential participation games, we introduce the concept of implementability under order in-dependent individual rationality. We ch ..."
Abstract - Add to MetaCart
We consider the implementation of an economic outcome under complete information when the principal cannot commit to a simul-taneous participation game. From a class of sequential participation games, we introduce the concept of implementability under order in-dependent individual rationality. We

Order-independence and Underspecification

by Reinhard Muskens - Ellipsis, Underspecification, Events and More in Dynamic Semantics. DYANA Deliverable R.2.2.C , 1995
"... this paper I shall give a set of simple LFG-like annotated phrase structure rules which connect underspecified representations with other components of the grammar. The rules may be traversed in any order. The underspecified representations will be much like the UDRSs of Reyle [1992], but will forma ..."
Abstract - Cited by 29 (4 self) - Add to MetaCart
], but will formally consist of two parts: (a) a set of equations in ordinary classical type logic with abbreviations that emulate the language of Discourse Representation Theory, and (b) a set of descriptions in the first-order language of trees. Both parts will be generated by the grammar in a relatively independent

Ordered Independent Scattering

by Charles M. Goldie, Sidney I. Resnick, Say Xn - Comm. Stat., Stoch. Models , 1996
"... Suppose (Xn ) n=1;2;::: is a sequence of independent, identically distributed random vectors in R 2 . Say Xn is a record if there is a record simultaneously in both coordinates at index n. For A R 2 , let NA be the number of records falling in region A. If A < B are two regions of R 2 suc ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
such that every point of A is south-west of every point of B, then NA and NB are independent. We call this property ordered independent scattering and discuss which other notions of record give rise to it. Keywords: Multivariate record values, independent scattering, order statistics, point process, Poisson

Order Independent Homotopic Thinning For Binary And . . .

by Vincent Ranwez, Pierre Soille , 2001
"... Homotopic thinning algorithms have long been investigated in pattern recognition and image analysis. However, they are order dependent in the sense that the output depends upon the order used for processing the image pixels (as well as the order in which homotopic structuring elements are applied ..."
Abstract - Cited by 16 (0 self) - Add to MetaCart
are applied for algorithms based on sequential homotopic thinning). In this paper, we tackle this problem by introducing the notion of order independent homotopic thinning. In its basic form, it leads to an order independent homotopic marking algorithm. However, when considering appropriate anchor points
Results 1 - 10 of 27,254