Sciweavers

3038 search results - page 124 / 608
» High-Speed Function Approximation
Sort
View
ICALP
2009
Springer
16 years 5 months ago
Bounds on the Size of Small Depth Circuits for Approximating Majority
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
Kazuyuki Amano
DAGSTUHL
1997
15 years 6 months ago
Interpolation and Approximation of Surfaces from Three-dimensional Scattered Data Points
There is a wide range of applications for which surface interpolation or approximation from scattered data points in space is important. Dependent on the field of application and...
Robert Mencl, Heinrich Müller
TCS
2008
15 years 4 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
ICCV
2009
IEEE
16 years 10 months ago
An Algorithm for Minimizing the Piecewise Smooth Mumford-Shah Functional
In this work we revisit the Mumford-Shah functional, one of the most studied variational approaches to image segmentation. The contribution of this paper is to propose an algori...
Thomas Pock, Daniel Cremers, Horst Bischof, Antoni...
ICANN
2007
Springer
15 years 11 months ago
Input Selection for Radial Basis Function Networks by Constrained Optimization
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...
Jarkko Tikka