2019 search results - page 178 / 404 » Programming with Shared Data Abstractions |
120
click to vote
EUROPAR
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
141
click to vote
ML
2010
ACM
15 years 1 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
121
click to vote
UM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. A promising approach towards evaluating adaptive systems is to decompose the adaptation process and evaluate the system in a “piece-wise” manner. This paper presents ...
137
click to vote
POPL
1998
ACM
15 years 7 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...