2766 search results - page 405 / 554 » Algorithms for trigonometric polynomials |
128
click to vote
ENTCS
2008
15 years 4 months ago
2008
In its recogniser form, Earley's algorithm for testing whether a string can be derived from a grammar is worst case cubic on general context free grammars (CFG). Earley gave ...
124
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
145
Voted
CAD
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...
134
click to vote
JCO
2006
15 years 4 months ago
2006
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
141
click to vote
JACM
2007
15 years 4 months ago
2007
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...