Results 1  10
of
390,601
Polynomial Precise Interval Analysis Revisited
"... We consider a class of arithmetic equations over the complete lattice of integers (extended with − ∞ and ∞) and provide a polynomial time algorithm for computing least solutions. For systems of equations with addition and least upper bounds, this algorithm is a smooth generalization of the Bellman ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider a class of arithmetic equations over the complete lattice of integers (extended with − ∞ and ∞) and provide a polynomial time algorithm for computing least solutions. For systems of equations with addition and least upper bounds, this algorithm is a smooth generalization
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
steady states it seems reasonable to try to find a way to com bine the two values. The simplest thing to do is to average them. Unfortunately, this gave very poor re sults, since the correct posteriors do not usually lie in the midpoint of the interval ( cf. 2More precisely, we found that with a
Interprocedural dataflow analysis via graph reachability
, 1994
"... The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow fun ..."
Abstract

Cited by 454 (34 self)
 Add to MetaCart
The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow
Interpolation revisited
 IEEE Transactions on Medical Imaging
, 2000
"... Abstract—Based on the theory of approximation, this paper presents a unified analysis of interpolation and resampling techniques. An important issue is the choice of adequate basis functions. We show that, contrary to the common belief, those that perform best are not interpolating. By opposition to ..."
Abstract

Cited by 198 (33 self)
 Add to MetaCart
Abstract—Based on the theory of approximation, this paper presents a unified analysis of interpolation and resampling techniques. An important issue is the choice of adequate basis functions. We show that, contrary to the common belief, those that perform best are not interpolating. By opposition
Interval estimation for a binomial proportion
 Statist. Sci
, 2001
"... Abstract. We revisit the problem of interval estimation of a binomial proportion. The erratic behavior of the coverage probability of the standardWaldconfidence interval has previously been remarkedon in the literature (Blyth andStill, Agresti andCoull, Santner andothers). We begin by showing that t ..."
Abstract

Cited by 190 (2 self)
 Add to MetaCart
Abstract. We revisit the problem of interval estimation of a binomial proportion. The erratic behavior of the coverage probability of the standardWaldconfidence interval has previously been remarkedon in the literature (Blyth andStill, Agresti andCoull, Santner andothers). We begin by showing
Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra
 Journal of the ACM
, 1995
"... We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the ORDHorn subclass is a polynomialtime problem and show that the pathconsistency method is sufficient ..."
Abstract

Cited by 199 (9 self)
 Add to MetaCart
We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the ORDHorn subclass is a polynomialtime problem and show that the pathconsistency method
Using dual approximation algorithms for scheduling problems: theoretical and practical results
 Journal of the ACM
, 1987
"... Abstract. The problem of scheduling a set of n jobs on m identical machines so as to minimize the makespan time is perhaps the most wellstudied problem in the theory of approximation algorithms for NPhard optimization problems. In this paper the strongest possible type of result for this problem, ..."
Abstract

Cited by 216 (2 self)
 Add to MetaCart
, a polynomial approximation scheme, is presented. More precisely, for each e, an algorithm that runs in time O((n/#“2) and has relative error at most c is given. In addition, more practical algorithms for c = l/5 + 2 ” and t = l/6 + 2‘, which have running times U(n(k + log n)) and O(n(km4 + log n
Time, space, and precision: Revisiting classic problems
"... in computational geometry with degreedriven analysis ..."
Results 1  10
of
390,601