Sciweavers

7 search results - page 1 / 2
» Noisy Interpolation of Sparse Polynomials, and Applications
Sort
View
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 4 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
13 years 4 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
13 years 10 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
IPMI
2001
Springer
14 years 5 months ago
Feature Enhancement in Low Quality Images with Application to Echocardiography
In this paper we propose a novel approach to feature enhancement to enhance the quality of noisy images. Our approach is based on a phase-based feature detection algorithm, followe...
Djamal Boukerroui, J. Alison Noble, Michael Brady
BMVC
2001
13 years 7 months ago
A Buyer's Guide to Euclidean Elliptical Cylindrical and Conical Surface Fitting
The ability to construct CAD or other object models from edge and range data has a fundamental meaning in building a recognition and positioning system. While the problem of model...
Petko Faber, Robert B. Fisher