2766 search results - page 357 / 554 » Algorithms for trigonometric polynomials |
120
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
122
click to vote
SPIRE
2007
Springer
15 years 10 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
128
click to vote
WABI
2007
Springer
15 years 10 months ago
2007
Springer
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
152
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
151
Voted
VTC
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— This paper proposes a maximum likelihood detection (MLD) method for the differential space-time block code (DSTBC) in cooperation with blind linear prediction (BLP) of ...