Sciweavers

18 search results - page 1 / 4
» Minimum Support Interpolators with Optimum Approximation Pro...
Sort
View
ICIP
1998
IEEE
14 years 6 months ago
Minimum Support Interpolators with Optimum Approximation Properties
Abstract- We investigate the functions of given approximation order L that have the smallest support. Those are shown to be linear combinations of the Bspline of degree .L - 1 and ...
Michael Unser, Philippe Thévenaz, Thierry B...
TSP
2012
12 years 13 days ago
Optimized Compact-Support Interpolation Kernels
Abstract—In this paper, we investigate the problem of designing compact-support interpolation kernels for a given class of signals. By using calculus of variations, we simplify t...
Ramtin Madani, Ali Ayremlou, Arash Amini, Farrokh ...
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 5 months ago
Quasi-Orthogonal STBC With Minimum Decoding Complexity
- A new class of Quasi-Orthogonal Space-Time Block Code (QO-STBC) namely Minimum-DecodingComplexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper...
Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
14 years 5 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler
SIAMSC
2008
191views more  SIAMSC 2008»
13 years 4 months ago
ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
Abstract. We present a new derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region framework using interpolati...
Stefan M. Wild, Rommel G. Regis, Christine A. Shoe...