نتایج جستجو برای: max product composition

تعداد نتایج: 575355  

Journal: :International journal of clinical pharmacology and therapeutics 2009
Z Chik R C Basu R Pendek T C Lee Z Mohamed

This study was carried out to compare the rate and extent of absorption of a generic salbutamol in oral dosage form (Brethmol, 4 mg) with the proprietary equivalent product (Ventolin, 4 mg), in healthy adult subjects, under fasting conditions. The study was a single dose, randomized, two way crossover study with a four-week washout period. It involved 22 healthy volunteers who received a single...

2012
Bartlomiej Bosek Stefan Felsner Kolja B. Knauer Grzegorz Matecki

We study a min-max relation conjectured by Saks and West: For any two posets P and Q the size of a maximum semiantichain and the size of a minimum unichain covering in the product P ×Q are equal. For positive we state conditions on P and Q that imply the min-max relation. However, we also have an example showing that in general the min-max relation is false. This disproves the Saks-West conject...

Journal: :CoRR 2001
Nikolai K. Krivulin

We consider (max,+)-algebra products of random matrices, which arise from performance evaluation of acyclic fork-join queueing networks. A new algebraic technique to examine properties of the product and investigate its limiting behaviour is proposed based on an extension of the standard matrix (max,+)-algebra by endowing it with the ordinary matrix addition as an external operation. As an appl...

Journal: :The American journal of clinical nutrition 2011
Na Zhu David R Jacobs Stephen Sidney Barbara Sternfeld Mercedes Carnethon Cora E Lewis Christina M Shay Akshay Sood Claude Bouchard

BACKGROUND The assessment of fat mass and fat-free mass in relation to the symptom-limited maximal exercise duration (Max(dur)) of a treadmill test allows for insight into the association of body composition with treadmill performance potential. OBJECTIVE We investigated the complex associations between fat mass and fat-free mass and Max(dur) in a population setting. DESIGN The Max(dur) of ...

Journal: :CoRR 2011
Daniel Tarlow Inmar E. Givoni Richard S. Zemel Brendan J. Frey

The maximum a posteriori (MAP) configuration of binary variable models with submodular graph-structured energy functions can be found efficiently and exactly by graph cuts. Max-product belief propagation (MP) has been shown to be suboptimal on this class of energy functions by a canonical counterexample where MP converges to a suboptimal fixed point (Kulesza & Pereira, 2008). In this work, we s...

2008
Hai Leong Chieu Wee Sun Lee

The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginals over covers, using joker states to represent clusters of configurations. The SP-y algorithm generalizes SP to work on the Max-SAT problem, but the cover interpretation of SP does not generalize to SP-y. Recently, a r...

2014
J. Boobalan S. Sriram

We introduce the concept of sandwich set of two fuzzy matrices.By using the new concept of sandwich set, we provide a method for finding a semi inverse of max-min product of fuzzy matrices. 1. Introduction Generalized inverse of matrices and its applications are studied by Rao and Mitra[3]. Ren et.al[4] introduced the concept of sandwich sets of matrices. By using the sandwich sets of matrices,...

2009
Arthur Choi Adnan Darwiche

We introduce a new perspective on approximations to the maximum a posteriori (MAP) task in probabilistic graphical models, that is based on simplifying a given instance, and then tightening the approximation. First, we start with a structural relaxation of the original model. We then infer from the relaxation its deficiencies, and compensate for them. This perspective allows us to identify two ...

2000
William T. Freeman Yair Weiss

Graphical models, such as Bayesian networks and Markov random fields represent statistical dependencies of variables by a graph. The max-product b̈elief propagationälgorithm is a localmessage passing algorithm on this graph that is known to converge to a unique fixed point when the graph is a tree. Furthermore, when the graph is a tree, the assignment based on the fixed-point is guaranteed to yi...

2016

Investigations into probabilistic graphical models for decision making have predominantly centered on influence diagrams (IDs) and decision circuits (DCs) for representation and computation of decision rules that maximize expected utility. Since IDs are typically handcrafted and DCs are compiled from IDs, in this paper we propose an approach to learn the structure and parameters of decision-mak...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید