Sciweavers

3038 search results - page 79 / 608
» High-Speed Function Approximation
Sort
View
ICPR
2008
IEEE
16 years 3 months ago
Kernel bandwidth estimation in methods based on probability density function modelling
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
Adrian G. Bors, Nikolaos Nasios
MOC
2002
75views more  MOC 2002»
15 years 2 months ago
Quincunx fundamental refinable functions and quincunx biorthogonal wavelets
Abstract. We analyze the approximation and smoothness properties of quincunx fundamental refinable functions. In particular, we provide a general way for the construction of quincu...
Bin Han 0003, Rong-Qing Jia
119
Voted
ICASSP
2011
IEEE
14 years 6 months ago
SRF: Matrix completion based on smoothed rank function
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
Hooshang Ghasemi, Mohmmadreza Malek-Mohammadi, Mas...
WINE
2005
Springer
182views Economy» more  WINE 2005»
15 years 7 months ago
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
Subhash Khot, Richard J. Lipton, Evangelos Markaki...
127
Voted
ECCV
2010
Springer
15 years 7 months ago
Single Image Deblurring Using Motion Density Functions
Abstract. We present a novel single image deblurring method to estimate spatially non-uniform blur that results from camera shake. We use existing spatially invariant deconvolution...