Results 131 to 140 of about 69,419 (165)

Complexity of Approximating CSP with Balance / Hard Constraints

Theory of Computing Systems, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Venkatesan Guruswami, Euiwoong Lee
openaire   +2 more sources

Approximating module semantics with constraints

Proceedings of the 2004 ACM symposium on Applied computing, 2004
In this paper we present a generic constraint domain for symbolic modular analysis. The idea is that the semantics of a module can be approximated by a set of relations symbolically linking the input, output and local variables. We show how this result is correct w.r.t.
openaire   +1 more source

Complex approximation with additional constraints

[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, 1992
A powerful signal exchange algorithm for the solution of the complex Chebyshev approximation problem was introduced by P.T.P. Tang (1988). It was picked up and modified by A. Alkhairy et al. (1991) for the design of digital FIR filters. This algorithm is extended to solve the approximation problem in conjunction with additional constraints, such as ...
openaire   +1 more source

Approximating shortest superstrings with constraints

1993
Various versions of the shortest common superstring problem play important roles in data compression and DNA sequencing. Only recently, the open problem of how to approximate a shortest superstring given a set of strings was solved in [1, 9]. [1] shows that several greedy algorithms produce a supeistring of length O(n), where n is the optimal length ...
Tao Jiang, Ming Li
openaire   +1 more source

Stochastic approximation. II. Optimization methods with constraints

Mathematica Applicanda, 1977
This is a critical review of recent results in stochastic approximation methods for optimization problems. Part II deals with constrained optimization; here, the stochastic variants of the penalty function method, the method of feasible directions and the method of Lagrange functions are discussed.
openaire   +2 more sources

Hierarchical matrix approximation with blockwise constraints

BIT Numerical Mathematics, 2012
A technique to preserve constraints on a hierarchical matrix approximation is presented. The preservation is done block-wise and it carries over to \(LU\) factorization. It is shown that a particular set of block-wise constraints leads to the preservation of a significantly larger set of global constraints due to the structure of the hierarchical ...
Bebendorf, Mario, Bollhöfer, Matthias, Bratsch, Michael   +2 more
openaire   +1 more source

Approximate pattern matching with gap constraints

Journal of Information Science, 2016
Pattern matching is a key issue in sequential pattern mining. Many researchers now focus on pattern matching with gap constraints. However, most of these studies involve exact pattern matching problems, a special case of approximate pattern matching and a more challenging task.
Youxi Wu, Zhiqiang Tang, He Jiang, Xindong Wu   +3 more
openaire   +1 more source

Computing smooth approximations of scalar functions with constraints

Computers & Graphics, 2009
In engineering, geographical applications, scientific visualization, and bio-informatics, a variety of phenomena is described by a large set of data modeled as the values of a scalar function f:M->R defined on a surface M. A low quality of the discrete representations of the input data, unstable computations, numerical approximations, and noise might ...
Patane' G, Falcidieno B
openaire   +2 more sources

Polynomial Approximations with Special Constraints

2016
In the previous chapter, we have explained how Remez’s algorithm can be used to compute minimax polynomial approximations to functions.
openaire   +1 more source

Best Approximation With Geometric Constraints

1989
This is a study of best approximation with certain geometric constraints. Two major problem areas are considered: best Lp approximation to a function in Lp (0,1) by convex functions, (m, n)-convex functions, (m, n)-convex functions and (m, n)-convex splines, for 1 < p < ∞ , and best uniform approximation to a continuous function by convex functions ...
openaire   +1 more source