2766 search results - page 237 / 554 » Algorithms for trigonometric polynomials |
164
click to vote
WDAG
2007
Springer
15 years 11 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
149
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
146
click to vote
ISVLSI
2002
IEEE
15 years 10 months ago
2002
IEEE
Retiming has been shown to be a powerful technique for improving the performance of synchronous circuits. However, even though retiming algorithms of polynomial time complexity ha...
168
click to vote
COCOON
2010
Springer
15 years 9 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
124
click to vote
DEXA
2008
Springer
15 years 7 months ago
2008
Springer
Multiple target tracking (MTT) is a well-studied technique in the field of radar technology, which associates anonymized measurements with the appropriate object trajectories. This...