2766 search results - page 209 / 554 » Algorithms for trigonometric polynomials |
129
Voted
ICIP
2006
IEEE
16 years 6 months ago
2006
IEEE
Consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomi...
145
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
133
click to vote
CADE
2009
Springer
15 years 11 months ago
2009
Springer
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...
132
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
132
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...