216 search results - page 7 / 44 » On the number of minima of a random polynomial |
86
Voted
ISSAC
2007
Springer
15 years 3 months ago
2007
Springer
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...
ALT
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
81
Voted
SIAMSC
2010
14 years 8 months ago
2010
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient ...
TOMS
2010
14 years 8 months ago
2010
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...