Sciweavers

7930 search results - page 515 / 1586
» Greedy in Approximation Algorithms
Sort
View
TASLP
2008
133views more  TASLP 2008»
15 years 7 months ago
Adaptive System Identification in the Short-Time Fourier Transform Domain Using Cross-Multiplicative Transfer Function Approxima
In this paper, we introduce cross-multiplicative transfer function (CMTF) approximation for modeling linear systems in the short-time Fourier transform (STFT) domain. We assume tha...
Yekutiel Avargel, Israel Cohen
ANOR
2004
116views more  ANOR 2004»
15 years 6 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
CGF
2002
107views more  CGF 2002»
15 years 6 months ago
Geometric Approximations Towards Free Specular Comic Shading
We extend the standard solution to comic rendering with a comic-style specular component. To minimise the computational overhead associated with this extension, we introduce two o...
Holger Winnemöller, Shaun Bangay
GEOINFORMATICA
1998
144views more  GEOINFORMATICA 1998»
15 years 6 months ago
Approximation-Based Similarity Search for 3-D Surface Segments
The issue of ®nding similar 3-D surface segments arises in many recent applications of spatial database systems, such as molecular biology, medical imaging, CAD, and geographic i...
Hans-Peter Kriegel, Thomas Seidl
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
15 years 6 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri