2766 search results - page 143 / 554 » Algorithms for trigonometric polynomials |
120
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
148
click to vote
RECOMB
2007
Springer
16 years 4 months ago
2007
Springer
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
122
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
117
click to vote
DAC
2009
ACM
16 years 5 months ago
2009
ACM
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
141
click to vote
ENGL
2008
15 years 4 months ago
2008
An array antenna system with innovative signal processing can enhance the resolution of a signal direction of arrival (DOA) estimation. Super resolution algorithms take advantage o...