2766 search results - page 35 / 554 » Algorithms for trigonometric polynomials |
135
Voted
SIAMCOMP
2010
14 years 7 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
90
Voted
SAS
2004
Springer
15 years 6 months ago
2004
Springer
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
103
click to vote
ICC
2008
IEEE
15 years 7 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
78
Voted
CADE
2006
Springer
16 years 29 days ago
2006
Springer
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresulta...
193
Voted
DMTCS
2011
14 years 13 days ago
2011
Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O(n5 log2 n).