Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
251
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 error-correcting codes. The most dramatic instance of this is the near Shannon-limit 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 well-known Pearl polytree algorithm [12] on a Bayesian network
Non-Deterministic Exponential Time has Two-Prover Interactive Protocols
"... We determine the exact power of two-prover inter-active proof systems introduced by Ben-Or, Goldwasser, Kilian, and Wigderson (1988). In this system, two all-powerful non-communicating 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 coNP-complete languages do not admit such proof systems. In sharp contrast, we show that the class of languages having two-prover interactive proof systems is nondeterministic exponential time. After the recent results
Nonexistence of voting rules that are usually hard to manipulate
- IN AAAI
, 2006
"... Aggregating the preferences of self-interested agents is a key problem for multiagent systems, and one general method for doing so is to vote over the alternatives (candidates). Unfor-tunately, the Gibbard-Satterthwaite theorem shows that when there are three or more candidates, all reasonable votin ..."
Abstract
-
Cited by 88 (8 self)
- Add to MetaCart
hard. This ap-proach has had some limited success, exhibiting rules under which the problem of finding a beneficial manipulation is NP-hard, #P-hard, or even PSPACE-hard. Thus, under these rules, it is unlikely that a computationally efficient algorithm can be constructed that always finds a beneficial
The nitrogen and phosphorus dependence of algal biomass in lakes: an empirical and theoretical analysis
- Limnol. Oceanogr
, 1982
"... An analysis of mean growing season concentrations of chlorophyll, total phosphorus (TP), and total nitrogen (TN) in 228 north latitude lakes confirms previous observations that chlo-rophyll yield is dependent both on the phosphorus concentration and on the TN:TP ratio. Of two modified chlorophyll mo ..."
Abstract
-
Cited by 62 (5 self)
- Add to MetaCart
models which depend explicitly on both nitrogen and phosphorus developed and tested, one, a multiple regression model, appears to greatly reduce the error of chlorophyll prediction in lakes. A theoretical framework is presented which provides an explanation for the observed effects of N:P ratios
Physicochemical parameters associated with nanoparticle formation in the salting-out, emulsification-diffusion, and nanoprecipitation
"... Purpose. The aim of this work was to relate the physicochemical properties of the aqueous and organic phases used for nanoparticle (NP) preparation to the formation of NP produced by salting-out, emulsification-diffusion, and nanoprecipitation. Methods. Methacrylic acid copolymer and poly(vinyl alco ..."
Abstract
-
Cited by 17 (0 self)
- Add to MetaCart
by their viscosity and surface tension. NP characteristics such as particle mean size, residual surfactant, sus-pendability in water after freeze-drying, and morphology were ex-plained in terms of these properties. For nanoprecipitation, NP for-mation was analyzed considering the diffusion-stranding phenom
The Extreme Light Infrastructure Nuclear Physics (ELI-NP) facility
, 2013
"... which is being built at Bucharest–Magurele aims at utilizing extreme elec-tromagnetic fields for nuclear physics and quantum electrodynamics stud-ies. Two ten pentawatt high-power laser systems and a brilliant γ beam are the main research tools of the facility. Here, we present the current status an ..."
Abstract
- Add to MetaCart
and the perspectives for experiments with intense γ rays at ELI-NP. DOI:10.5506/APhysPolB.45.483 PACS numbers: 07.85.Fv, 29.20.Ej, 25.20.–x
Individual and synergistic effects of rabbit granulocyte proteins
- J. Clin. Invest. 94:672
, 1994
"... Affinity purification of crude acid extracts of rabbit poly-morphonuclear leukocytes using Escherichia coli (J5) as ad-sorbent yields the bactericidal/permeability-increasing pro-tein (BPI), two 15-kD species (pl5s), and the two most potent (cationic) defensin species (neutrophil peptides [NP]-1 and ..."
Abstract
-
Cited by 15 (5 self)
- Add to MetaCart
Affinity purification of crude acid extracts of rabbit poly-morphonuclear leukocytes using Escherichia coli (J5) as ad-sorbent yields the bactericidal/permeability-increasing pro-tein (BPI), two 15-kD species (pl5s), and the two most potent (cationic) defensin species (neutrophil peptides [NP]-1
On Two Techniques of Combining Branching and Treewidth
- ALGORITHMICA (2009) 54: 181–207
, 2009
"... Branch & Reduce and dynamic programming on graphs of bounded treewidth are among the most common and powerful techniques used in the design of moderately exponential time exact algorithms for NP hard problems. In this pa-per we discuss the efficiency of simple algorithms based on combinations o ..."
Abstract
-
Cited by 19 (3 self)
- Add to MetaCart
algorithms. We give several ex-amples of possible combinations of branching and programming which provide the fastest known algorithms for a number of NP hard problems. All our algorithms re-quire non-trivial balancing of these two techniques. In the first approach the algorithm either performs fast
ON THE FUNCTIONAL CLT FOR PARTIAL SUMS OF TRUNCATED BOUNDED FROM BELOW RANDOM VARIABLES
"... Abstract. Let {X,Xi}i≥1 be i.i.d. bounded from below continuous random variables, E|X | < ∞, EX2 = ∞, and {bn}n≥1 be a sequence of increasing positive numbers. When X belongs to the Feller class and bn is such that nP X> bn ..."
Abstract
- Add to MetaCart
Abstract. Let {X,Xi}i≥1 be i.i.d. bounded from below continuous random variables, E|X | < ∞, EX2 = ∞, and {bn}n≥1 be a sequence of increasing positive numbers. When X belongs to the Feller class and bn is such that nP X> bn
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 struc-tural 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 NP-complete. Hence implementing a given random assignment via deterministic Pareto opti-mal assignments is NP-hard. We then formalize another
Results 1 - 10
of
251
