2957 search results - page 333 / 592 » The Complexity of Polynomial-Time Approximation |
140
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
155
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents an efficient approach to compute the dominant poles for the reduced-order admittance (Y parameter) matrix of lossy interconnects. Using the global approximati...
183
click to vote
HAIS
2009
Springer
15 years 11 months ago
2009
Springer
In engineering design the use of approximation models (= surrogate models) has become standard practice for design space exploration, sensitivity analysis, visualization and optimi...
154
click to vote
APGV
2007
ACM
15 years 10 months ago
2007
ACM
Much research in recent times has been conducted towards realtime rendering of accurate glossy reflections under direct, natural illumination including correct occlusions. The vie...
163
click to vote
FSE
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...