Results 1  10
of
246
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
. Introduction The task of calculating posterior marginals on nodes in an arbitrary Bayesian network is known to be NP hard In this paper we investigate the approximation performance of "loopy belief propagation". This refers to using the wellknown Pearl polytree algorithm [12] on a Bayesian network
NonDeterministic Exponential Time has TwoProver Interactive Protocols
"... We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract

Cited by 416 (37 self)
 Add to MetaCart
to the language L. It was previously suspected (and proved in a relativized sense) that coNPcomplete languages do not admit such proof systems. In sharp contrast, we show that the class of languages having twoprover interactive proof systems is nondeterministic exponential time. After the recent results
RESEARCH Decreased P27 protein ex h
"... carcinoma derived from mucosal epithelium of the naso genes among NPC and nasopharyngeal tissues (NP) and ..."
Abstract
 Add to MetaCart
carcinoma derived from mucosal epithelium of the naso genes among NPC and nasopharyngeal tissues (NP) and
18.443 Statistics for Applications
"... First, here is some notation for binomial probabilities. Let X be the number of successes in n independent trials with probability p of success on each trial. Let q ≡ 1−p. Then we know that EX = np, the variance of X is npq where q = 1 − p, and so the ..."
Abstract
 Add to MetaCart
First, here is some notation for binomial probabilities. Let X be the number of successes in n independent trials with probability p of success on each trial. Let q ≡ 1−p. Then we know that EX = np, the variance of X is npq where q = 1 − p, and so the
P(X> (1 + ε)µ) <
"... Problem 1: (20 points) Suppose we have random variables δ1,..., δn, independent and each either 0 or 1 with E δi = p. Write X = ∑n i=1 δi and µ = EX = np. The Chernoff bound states that for any ε> 0 ..."
Abstract
 Add to MetaCart
Problem 1: (20 points) Suppose we have random variables δ1,..., δn, independent and each either 0 or 1 with E δi = p. Write X = ∑n i=1 δi and µ = EX = np. The Chernoff bound states that for any ε> 0
#bep}){ebu+y Łffzff{exs}
"... cflP9(QdffY:&b`e(QX)fgS^,W&!f#*>WPh S*+*iY:T#YjW&!kl'fimff9n off9np" ..."
Structure and complexity of ex post efficient random assignments
, 2014
"... In the random assignment problem, objects are randomly assigned to agents keeping in view the agents ’ preferences over objects. A random assignment specifies the probability of an agent getting an object. We examine the structural and computational aspects of ex post efficiency of random assignmen ..."
Abstract
 Add to MetaCart
assignments. We first show that whereas an ex post efficient assignment can be computed easily, checking whether a given random assignment is ex post efficient is NPcomplete. Hence implementing a given random assignment via deterministic Pareto optimal assignments is NPhard. We then formalize another
Nonexistence of voting rules that are usually hard to manipulate
 IN AAAI
, 2006
"... Aggregating the preferences of selfinterested agents is a key problem for multiagent systems, and one general method for doing so is to vote over the alternatives (candidates). Unfortunately, the GibbardSatterthwaite theorem shows that when there are three or more candidates, all reasonable votin ..."
Abstract

Cited by 88 (8 self)
 Add to MetaCart
hard. This approach has had some limited success, exhibiting rules under which the problem of finding a beneficial manipulation is NPhard, #Phard, or even PSPACEhard. Thus, under these rules, it is unlikely that a computationally efficient algorithm can be constructed that always finds a beneficial
Ex Vivo Observation of Human Nucleus Pulposus Chondrocytes Isolated From Degenerated Intervertebral Discs
"... Study Design: We performed an ex vivo study to observe cell morphology and viability of human nucleus pulposus (NP) chondrocytes isolated from degenerated intervertebral discs (IVD). Purpose: To better understand the biological behavior of NP chondrocytes in monolayer cultures. Overview of Literatur ..."
Abstract
 Add to MetaCart
Study Design: We performed an ex vivo study to observe cell morphology and viability of human nucleus pulposus (NP) chondrocytes isolated from degenerated intervertebral discs (IVD). Purpose: To better understand the biological behavior of NP chondrocytes in monolayer cultures. Overview
Expression of ⌬Np63 in Response to Phorbol Ester in Human Limbal Epithelial Cells Expanded on Intact Human Amniotic Membrane
, 2003
"... PURPOSE. To evaluate the effect of phorbol 12myristate 13acetate (PMA) on the expression of ⌬Np63 in human limbal epithelial cells (HLECs) during ex vivo expansion on amniotic membrane (AM). METHODS. Primary HLECs were cultured either on AM or plastic surfaces and were treated with 1 g/mL PMA for ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
PURPOSE. To evaluate the effect of phorbol 12myristate 13acetate (PMA) on the expression of ⌬Np63 in human limbal epithelial cells (HLECs) during ex vivo expansion on amniotic membrane (AM). METHODS. Primary HLECs were cultured either on AM or plastic surfaces and were treated with 1 g/mL PMA
Results 1  10
of
246