2766 search results - page 122 / 554 » Algorithms for trigonometric polynomials |
156
click to vote
ISAAC
2000
Springer
15 years 7 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
116
click to vote
SECON
2010
IEEE
15 years 1 months ago
2010
IEEE
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In thi...
157
Voted
GLVLSI
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we propose a novel statistical capacitance extraction method for interconnects considering process variations. The new method, called statCap, is based on the spect...
151
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
138
Voted
DISOPT
2007
15 years 3 months ago
2007
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....