Sciweavers

1469 search results - page 121 / 294
» Approximate polynomial decomposition
Sort
View
NA
2007
80views more  NA 2007»
14 years 9 months ago
Image reconstruction by OPED algorithm with averaging
Abstract. OPED is a new image reconstruction algorithm based on orthogonal polynomial expansion on the disk. We show that the integral of the approximation function in OPED can be ...
Yuan Xu, Oleg Tischenko, Christoph Hoeschen
JC
2011
102views more  JC 2011»
14 years 5 months ago
Tractability of tensor product problems in the average case setting
It has been an open problem to derive a necessary and sufficient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...
Anargyros Papageorgiou, Iasonas Petras
ICASSP
2011
IEEE
14 years 1 months ago
Sequential Monte Carlo method for parameter estimation in diffusion models of affinity-based biosensors
Estimation of the amounts of target molecules in realtime affinity-based biosensors is studied. The problem is mapped to inferring the parameters of a temporally sampled diffusio...
Manohar Shamaiah, Xiaohu Shen, Haris Vikalo
COMPUTING
2006
112views more  COMPUTING 2006»
14 years 10 months ago
Fast Summation of Radial Functions on the Sphere
Radial functions are a powerful tool in many areas of multidimensional approximation, especially when dealing with scattered data. We present a fast approximate algorithm for the ...
Jens Keiner, Stefan Kunis, Daniel Potts
ICC
2007
IEEE
15 years 4 months ago
PERD: Polynomial-based Event Region Detection in Wireless Sensor Networks
We propose a Polynomial-based scheme that addresses the problem of Event Region Detection (PERD) for wireless sensor networks (WSNs). Nodes of an aggregation tree perform function ...
Torsha Banerjee, Demin Wang, Bin Xie, Dharma P. Ag...