Sciweavers

7519 search results - page 1385 / 1504
» Optimizing Generic Functions
Sort
View
150
Voted
STACS
1999
Springer
15 years 6 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
117
Voted
CONEXT
2007
ACM
15 years 6 months ago
Improving service differentiation in IP networks through dual topology routing
The convergence on IP of a wide variety of traffic types has strengthened the need for service differentiation. Service differentiation relies on two equally important components:...
Kin Wah Kwong, Roch Guérin, Anees Shaikh, S...
162
Voted
DAC
2004
ACM
15 years 6 months ago
A methodology to improve timing yield in the presence of process variations
The ability to control the variations in IC fabrication process is rapidly diminishing as feature sizes continue towards the sub-100 nm regime. As a result, there is an increasing...
Sreeja Raj, Sarma B. K. Vrudhula, Janet Meiling Wa...
141
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
113
Voted
LCPC
2000
Springer
15 years 6 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
« Prev « First page 1385 / 1504 Last » Next »