2944 search results - page 94 / 589 » Improving Bound Propagation |
135
click to vote
JSC
2010
15 years 2 months ago
2010
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
134
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
75
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We prove that the constraint languages invariant under a short sequence of J´onsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they h...
118
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
Let ( ) denote the maximum size of a -ary code of length and distance . We study the minimum asymptotic redundancy ( ) = log ( ) as grows while and are fixed. For any and 1, long a...
119
click to vote
CSDA
2004
15 years 4 months ago
2004
Using a B-spline representation for splines with knots seen as free variables, the approximation to data by splines improves greatly. The main limitations are the presence of too ...