Sciweavers

467 search results - page 29 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
ADCM
2008
112views more  ADCM 2008»
14 years 12 months ago
Frames in spaces with finite rate of innovation
Abstract. Signals with finite rate of innovation are those signals having finite degrees of freedom per unit of time that specify them. In this paper, we introduce a prototypical s...
Qiyu Sun
86
Voted
MOC
2010
14 years 6 months ago
Computation of conformal representations of compact Riemann surfaces
We find a system of two polynomial equations in two unknowns, whose solution allows us to give an explicit expression of the conformal representation of a simply connected three-sh...
Guillermo López Lagomasino, Domingo Pestana...
ISSAC
2009
Springer
167views Mathematics» more  ISSAC 2009»
15 years 6 months ago
High order derivatives and decomposition of multivariate polynomials
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
Jean-Charles Faugère, Ludovic Perret
ACNS
2010
Springer
134views Cryptology» more  ACNS 2010»
15 years 26 days ago
Efficient and Secure Evaluation of Multivariate Polynomials and Applications
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...
Matthew K. Franklin, Payman Mohassel
66
Voted
NIPS
2008
15 years 1 months ago
Near-minimax recursive density estimation on the binary hypercube
This paper describes a recursive estimation procedure for multivariate binary densities using orthogonal expansions. For d covariates, there are 2d basis coefficients to estimate,...
Maxim Raginsky, Svetlana Lazebnik, Rebecca Willett...