2766 search results - page 295 / 554 » Algorithms for trigonometric polynomials |
139
click to vote
DAM
2002
15 years 4 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
142
click to vote
JCO
2002
15 years 4 months ago
2002
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
225
click to vote
SMI
2010
IEEE
15 years 3 months ago
2010
IEEE
We present a method to compute the medial axis of a smooth curve or surface by using PHT-spline (polynomial splines over hierarchical T-meshes) hierarchical approximation. In part...
162
click to vote
FSTTCS
2010
Springer
15 years 3 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
162
Voted
CORR
2011
Springer
15 years 12 hour ago
2011
Springer
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists ...