Sciweavers

37 search results - page 2 / 8
» A Hardware-Oriented Method for Evaluating Complex Polynomial...
Sort
View
ALDT
2009
Springer
186views Algorithms» more  ALDT 2009»
13 years 12 months ago
The Complexity of Probabilistic Lobbying
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 ...
Gábor Erdélyi, Henning Fernau, Judy ...
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 5 months ago
Interpolation in Valiant's theory
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...
Pascal Koiran, Sylvain Perifel
ISSAC
1995
Springer
125views Mathematics» more  ISSAC 1995»
13 years 9 months ago
Numeric-Symbolic Algorithms for Evaluating One-Dimensional Algebraic Sets
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
Shankar Krishnan, Dinesh Manocha
MOC
2002
135views more  MOC 2002»
13 years 5 months ago
A fast spherical harmonics transform algorithm
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
Reiji Suda, Masayasu Takami
WSCG
2004
157views more  WSCG 2004»
13 years 6 months ago
Efficient Implementation of Higher Order Image Interpolation
This work presents a new method of fast cubic and higher order image interpolation. The evaluation of the piecewise n-th order polynomial kernels is accelerated by transforming th...
Roland Perko, Horst Bischof