304 search results - page 9 / 61 » An Efficient Method for Evaluating Complex Polynomials |
DAGSTUHL
2008
13 years 10 months ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
CISST
2003
13 years 10 months ago
2003
This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does ...
SIGIR
2008
ACM
13 years 9 months ago
2008
ACM
We consider the problem of large scale retrieval evaluation. Recently two methods based on random sampling were proposed as a solution to the extensive effort required to judge te...
ALDT
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...