Sciweavers

3038 search results - page 142 / 608
» High-Speed Function Approximation
Sort
View
CISS
2008
IEEE
15 years 11 months ago
On sparse representations of linear operators and the approximation of matrix products
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
Mohamed-Ali Belabbas, Patrick J. Wolfe
CP
2004
Springer
15 years 10 months ago
Quality of LP-Based Approximations for Highly Combinatorial Problems
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
Lucian Leahu, Carla P. Gomes
131
Voted
ICIAR
2010
Springer
15 years 9 months ago
Structural Similarity-Based Approximation of Signals and Images Using Orthogonal Bases
The structural similarity (SSIM) index has been shown to be an useful tool in a wide variety of applications that involve the assessment of image quality and similarity. However, i...
Dominique Brunet, Edward R. Vrscay, Zhou Wang
PG
2000
IEEE
15 years 9 months ago
Interpolating and Approximating Moving Frames Using B-splines
The representation of moving geometry entities is an important issue in the fields of CAD/CAM and robotics motion design. We present a method to interpolate the moving frame homog...
Lizhuang Ma, Tony K. Y. Chan, Zhongding Jiang
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
15 years 7 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz