2766 search results - page 101 / 554 » Algorithms for trigonometric polynomials |
109
click to vote
TCS
2008
15 years 28 days ago
2008
This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...
100
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
109
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract--The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoreti...
STOC
2007
ACM
16 years 1 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
128
Voted
IJNSEC
2010
14 years 7 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...