Sciweavers

9595 search results - page 239 / 1919
» Functional programming in C
Sort
View
DAGSTUHL
2006
15 years 7 months ago
Bounds on the Fourier Coefficients of the Weighted Sum Function
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an...
Igor Shparlinski
ICTAC
2007
Springer
16 years 16 days ago
Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
Abstract. Differing from [6] this paper reduces non-linear ranking function discovering for polynomial programs to semi-algebraic system solving, and demonstrates how to apply the...
Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan, Cha...
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 10 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
ECCV
2000
Springer
16 years 8 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes
JCT
2000
103views more  JCT 2000»
15 years 6 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver