2766 search results - page 93 / 554 » Algorithms for trigonometric polynomials |
103
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
123
Voted
IWOCA
2010
Springer
14 years 7 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
ICIP
2005
IEEE
16 years 2 months ago
2005
IEEE
In this paper, we propose new sampling schemes for classes of 2-D signals with finite rate of innovation (FRI). In particular, we consider sets of 2-D Diracs and bilevel polygons....
111
Voted
WG
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
124
click to vote
COCO
2001
Springer
15 years 5 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...